CTL and ECTL as fragments of the modal &mgr;-calculus
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Fast and simple nested fixpoints
Information Processing Letters
Computer Networks
Local Parallel Model Checking for the Alternation-Free µ-Calculus
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Efficent Local Model-Checking for Fragments of teh Modal µ-Calculus
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Efficient model checking via the equational /spl mu/-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Automata logics, and infinite games
Distributed Local Resolution of Boolean Equation Systems
PDP '05 Proceedings of the 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing
Sequential and distributed model checking of Petri nets
International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking
Assumption-based distribution of CTL model checking
International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking
Distributed Symbolic Model Checking for μ-Calculus
Formal Methods in System Design
Verification of a sliding window protocol in μCRL and PVS
Formal Aspects of Computing
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems
CTL* model checking on a shared-memory architecture
Formal Methods in System Design
A Database Approach to Distributed State Space Generation
Electronic Notes in Theoretical Computer Science (ENTCS)
An accelerated algorithm for 3-color parity games with an application to timed games
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Scalable multi-core LTL model-checking
Proceedings of the 14th international SPIN conference on Model checking software
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Distributed on-the-fly model checking and test case generation
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems
Information and Computation
Stuttering mostly speeds up solving parity games
NFM'11 Proceedings of the Third international conference on NASA Formal methods
On parallel software verification using boolean equation systems
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
An experiment on parallel model checking of a CTL fragment
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Concurrent small progress measures
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
| Hi-index | 0.00 |
We describe a parallel algorithm for solving parity games, with applications in, e.g., modal @m-calculus model checking with arbitrary alternations, and (branching) bisimulation checking. The algorithm is based on Jurdzinski's Small Progress Measures. Actually, this is a class of algorithms, depending on a selection heuristics. Our algorithm operates lock-free, and mostly wait-free (except for infrequent termination detection), and thus allows maximum parallelism. Additionally, we conserve memory by avoiding storage of predecessor edges for the parity graph through strictly forward-looking heuristics. We evaluate our multi-core implementation's behaviour on parity games obtained from @m-calculus model checking problems for a set of communication protocols, randomly generated problem instances, and parametric problem instances from the literature.