Distributed symbolic model checking for \(\mu\)-calculus
From MaRDI portal
Publication:816198
DOI10.1007/S10703-005-1493-1zbMath1083.68069OpenAlexW2086845443MaRDI QIDQ816198
Orna Grumberg, Assaf Schuster, Tamir Heyman
Publication date: 20 February 2006
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-005-1493-1
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- Tableau-based model checking in the propositional mu-calculus
- Local model checking in the modal mu-calculus
- Symbolic model checking: \(10^{20}\) states and beyond
- The NX message passing interface
- A scalable parallel algorithm for reachability analysis of very large circuits
- A lattice-theoretical fixpoint theorem and its applications
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Graph-Based Algorithms for Boolean Function Manipulation
This page was built for publication: Distributed symbolic model checking for \(\mu\)-calculus