Efficient Verification of Timed Automata with BDD-Like Data-Structures
Abstract elided by the publisher.
Related papers
- Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures CAV 2004
- Efficient Verification with BDDs using Implicitly Conjoined Invariants CAV 1993
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests POPL 2015
- Rabbit: A Tool for BDD-Based Verification of Real-Time Systems CAV 2003
- Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification TACAS 2025
- Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms CAV 2023
- Symbolic Model Checking without BDDs TACAS 1999
- BDD4BNN: A BDD-Based Quantitative Analysis Framework for Binarized Neural Networks CAV 2021