Toupie=μ-calculus+constraints
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 114-126
- https://doi.org/10.1007/3-540-60045-0_44
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Algorithms for discrete function manipulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Symbolic model checking and constraint logic programming: A cross-fertilizationPublished by Springer Nature ,1994
- Generating BDDs for symbolic model checking in CCSDistributed Computing, 1993
- Delay analysis in synchronous programsPublished by Springer Nature ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- Verification of synchronous sequential machines based on symbolic executionPublished by Springer Nature ,1990
- Constraint logic programmingPublished by Association for Computing Machinery (ACM) ,1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Algebraic laws for nondeterminism and concurrencyJournal of the ACM, 1985