Distributed Symbolic Model Checking for μ-Calculus
- 4 July 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 350-362
- https://doi.org/10.1007/3-540-44585-4_32
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Achieving Scalability in Parallel Reachability Analysis of Very Large CircuitsLecture Notes in Computer Science, 2000
- Reachability analysis using partitioned-ROBDDsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- An improved algorithm for the evaluation of fixpoint expressionsLecture Notes in Computer Science, 1994
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992
- Tableau-based model checking in the propositional mu-calculusActa Informatica, 1990
- Local model checking in the modal mu-calculusLecture Notes in Computer Science, 1989
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Checking that finite state concurrent programs satisfy their linear specificationPublished by Association for Computing Machinery (ACM) ,1985
- Automatic verification of finite state concurrent system using temporal logic specificationsPublished by Association for Computing Machinery (ACM) ,1983
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955