The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We show that Model Checking in the Modal Mu-Calculus (MCMMC)--- the problem of checking whether an LTS is a model of a formula of the propositional modal mu-calculus--- is P-hard even for a very restrictive version of the problem involving the alternation-free fragment. In particular, MCMMC is P-hard even if the formula is fixed and alternationfree, and the LTS is deterministic, acyclic, and has fan-in and fan-out bounded by 2. The reduction used is from a restricted version of the circuit value problem known as Synchronous Alternating Monotone Fanout
|
996
|
Automatic verification of finite-state concurrent systems using temporal logic specifications
– Clarke, Emerson, et al.
- 1986
|
|
402
|
Algebraic laws for nondeterminism and concurrency
– Hennessy, Milner
- 1985
|
|
294
|
Results on the propositional -calculus
– Kozen
- 1983
|
|
285
|
Propositional dynamic logic of regular programs
– Fischer, Ladner
- 1979
|
|
196
|
The Concurrency Workbench: A semantics-based tool for the veri of systems
– Cleaveland, Parrow, et al.
- 1993
|
|
182
|
Efficient model checking in fragments of the propositional mu-calculus
– Emerson, Lei
- 1986
|
|
158
|
Results on the propositional µ-calculus
– Kozen
- 1983
|
|
135
|
CCS Expressions, Finite State Processes, and Three Problems of Equivalence
– Kanellakis, Smolka
- 1983
|
|
104
|
A linear-time model-checking algorithm for the alternation-free modal mu-calculus. CAV’91
– Cleaveland, Steffen
|
|
67
|
On model-checking for fragments of _-calculus
– Emerson, Jutla, et al.
- 1993
|
|
35
|
AUTO and Autograph
– Roy, Simone
- 1990
|
|
34
|
Faster model checking for the modal mu-calculus
– Cleaveland, Klein, et al.
- 1993
|
|
33
|
Deciding bisimilarity is P-complete
– Balcazar, Gabarro, et al.
- 1992
|
|
33
|
Parallel Complexity of Logical Query Programs
– Ullman, Gelder
- 1988
|
|
27
|
A parallel algorithm for constructing binary decision diagrams
– Kimura, Clarke
- 1990
|
|
27
|
Verification in XESAR of the Sliding Window protocol
– Richier, Rodriguez, et al.
- 1987
|
|
25
|
Computing Behavioural Relations, Logically
– Cleaveland, Steffen
- 1991
|
|
21
|
A compendium of problems complete for P
– Greenlaw, Hoover, et al.
- 1991
|
|
17
|
Logic Programming and Parallel Complexity
– Kanellakis
- 1986
|
|
17
|
List ranking and parallel tree contraction
– Reid-Miller, Miller, et al.
- 1993
|
|
16
|
Characteristic formulae
– Steffen
- 1989
|
|
10
|
Parallel complexity of simple logic programs
– Afrati, Papadimitriou
- 1993
|
|
5
|
Towards efficient parallelization of equivalence checking algorithms
– Zhang, Smolka
- 1992
|
|
3
|
Vectorized symbolic model checking of computation tree logic for sequential machine verification
– Hiraishi, Hamaguchi, et al.
- 1991
|
|
3
|
Parallel Algorithms for Relational Coarsest Partition Problems
– Rajasekaran, Lee
- 1993
|
|
1
|
Vectorized Model Checking for Computation Tree Logic
– Hiraishi, Meki, et al.
- 1990
|
|
1
|
Fast Parallel Deterministic and Randomized Algorithms for Model Checking
– Lee, Rajasekaran
- 1993
|
|
1
|
Parallel Complexity of Logical Inference
– Ullman
- 1992
|
|
1
|
and Sanguthevar Rajasekaran. Fast parallel deterministic and randomized algorithms for model checking
– Lee
- 1993
|
|
