Saturation-Based Symbolic Reachability Analysis Using Conjunctive and Disjunctive Partitioning
Open Access
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 146-161
- https://doi.org/10.1007/11560548_13
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circlePublished by Elsevier ,2004
- Saturation UnboundPublished by Springer Nature ,2003
- A data structure for the efficient Kronecker solution of GSPNsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Logical and Stochastic Modeling with SmartPublished by Springer Nature ,2003
- Efficient Symbolic Model Checking of Software Using Partial Disjunctive PartitioningPublished by Springer Nature ,2003
- Saturation: An Efficient Iteration Strategy for Symbolic State—Space GenerationPublished by Springer Nature ,2001
- Symbolic guided search for CTL model checkingPublished by Association for Computing Machinery (ACM) ,2000
- Symbolic Reachability Analysis Based on SAT-SolversPublished by Springer Nature ,2000
- NuSMV: A New Symbolic Model VerifierLecture Notes in Computer Science, 1999
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986