Parallel Model Checking for the Alternation Free μ-Calculus
- 23 March 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 543-558
- https://doi.org/10.1007/3-540-45319-9_37
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Improved reachability analysis of large finite state machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An automata-theoretic approach to branching-time model checkingJournal of the ACM, 2000
- A Formal Specification and Validation of a Critical System in Presence of Byzantine ErrorsLecture Notes in Computer Science, 2000
- Achieving Scalability in Parallel Reachability Analysis of Very Large CircuitsLecture Notes in Computer Science, 2000
- Limits to Parallel ComputationPublished by Oxford University Press (OUP) ,1995
- New techniques for efficient verification with implicitly conjoined BDDsPublished by Association for Computing Machinery (ACM) ,1994
- CONCUR '92Lecture Notes in Computer Science, 1992
- Derivation of a termination detection algorithm for distributed computationsInformation Processing Letters, 1983
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Using branching time temporal logic to synthesize synchronization skeletonsScience of Computer Programming, 1982