Criteria for the Simple Path Property in Timed Automata
No abstract available.
Related papers
- Modeling Concurrency in Parallel Debugging PPoPP 1990
- Compositional Verification of Timed Automata via Violation Assumptions CAV 2026
- The Complex(ity) Landscape of Checking Infinite Descent POPL 2024
- Reduction of Nondeterministic Tree Automata TACAS 2016
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth POPL 2015
- Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach TOPLAS 1997
- Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming VMCAI 2010
- Comprehensive path-sensitive data-flow analysis CGO 2008