Generating BDDs for symbolic model checking in CCS
- 1 April 1993
- journal article
- Published by Springer Nature in Distributed Computing
- Vol. 6 (3) , 155-164
- https://doi.org/10.1007/bf02242704
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Symbolic model checking: 10/sup 20/ states and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Verification in process algebra of the distributed control of track vehicles—A case studyPublished by Springer Nature ,1993
- An implementation of an efficient algorithm for bisimulation equivalenceScience of Computer Programming, 1990
- The concurrency workbenchPublished by Springer Nature ,1990
- Representation by finite automataPublished by Springer Nature ,1989
- Local model checking in the modal mu-calculusLecture Notes in Computer Science, 1989
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986