On the parallel complexity of model checking in the modal mu-calculus
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Vectorized model checking for computation tree logicPublished by Springer Nature ,2005
- A parallel algorithm for constructing binary decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The concurrency factory - Practical tools for specification, simulation, verification, and implementation of concurrent systemsPublished by American Mathematical Society (AMS) ,1994
- Vectorized symbolic model checking of computation tree logic for sequential machine verificationPublished by Springer Nature ,1992
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Parallel complexity of logical query programsAlgorithmica, 1988
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979