Using Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths
- 5 November 2002
- book chapter
- Published by Springer Nature
- p. 256-273
- https://doi.org/10.1007/3-540-36126-x_16
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Saturation: An Efficient Iteration Strategy for Symbolic State—Space GenerationPublished by Springer Nature ,2001
- Efficient Symbolic State-Space Construction for Asynchronous SystemsPublished by Springer Nature ,2000
- Symbolic Reachability Analysis Based on SAT-SolversPublished by Springer Nature ,2000
- Symbolic Model Checking without BDDsPublished by Springer Nature ,1999
- Algebric Decision Diagrams and Their ApplicationsFormal Methods in System Design, 1997
- Overview of decision diagramsIEE Proceedings - Computers and Digital Techniques, 1997
- Verification of arithmetic circuits with binary moment diagramsPublished by Association for Computing Machinery (ACM) ,1995
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Computer-Oriented Formulation of Transition-Rate Matrices via Kronecker AlgebraIEEE Transactions on Reliability, 1981