On-the-fly Verification of Linear Temporal Logic
- 17 September 1999
- book chapter
- Published by Springer Nature
- p. 253-271
- https://doi.org/10.1007/3-540-48119-2_16
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Implicit and incremental computation of primes and essential primes of Boolean functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within AraliaReliability Engineering & System Safety, 1997
- Partial-Order Methods for the Verification of Concurrent SystemsPublished by Springer Nature ,1996
- All from one, one for all: on model checking using representativesPublished by Springer Nature ,1993
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- An improved protocol reachability analysis techniqueSoftware: Practice and Experience, 1988
- 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
- Binary Decision DiagramsIEEE Transactions on Computers, 1978