Symbolic Exploration of transition Hierarchies
Abstract elided by the publisher.
Related papers
- Psym: Efficient Symbolic Exploration of Distributed Systems PLDI 2023
- Computing Bottom SCCs Symbolically Using Transition Guided Reduction CAV 2021
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests POPL 2015
- Building and Maintaining Analysis-Level Class Hierarchies Using Galois Lattices OOPSLA 1993
- Efficient Guiding Towards Cost-Optimality in UPPAAL TACAS 2001
- Abstraction Refinement Algorithms for Timed Automata CAV 2019
- Multi-core On-The-Fly Saturation TACAS 2019
- EmergenTheta: Variations on Symbolic Transition Systems (Competition Contribution) TACAS 2025