Mosel: A flexible toolset for monadic second-order logic
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 183-202
- https://doi.org/10.1007/bfb0035388
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Symbolic model checking: 10/sup 20/ states and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A case study in verification based on trace abstractionsPublished by Springer Nature ,1996
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- Automata on Infinite ObjectsPublished by Elsevier ,1990
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960