Checking Timed Büchi Automata Emptiness Using LU-Abstractions
From MaRDI portal
Publication:3648834
DOI10.1007/978-3-642-04368-0_18zbMath1262.68093OpenAlexW1964976168MaRDI QIDQ3648834
Publication date: 1 December 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04368-0_18
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (8)
On clock-aware LTL parameter synthesis of timed automata ⋮ LTL Parameter Synthesis of Parametric Timed Automata ⋮ Efficient emptiness check for timed Büchi automata ⋮ Proving the existence of fair paths in infinite-state systems ⋮ Certifying emptiness of timed Büchi automata ⋮ Iterative bounded synthesis for efficient cycle detection in parametric timed automata ⋮ Coarse Abstractions Make Zeno Behaviours Difficult to Detect ⋮ Zone-based verification of timed automata: extrapolations, simulations and what next?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Checking timed Büchi automata emptiness efficiently
- A theory of timed automata
- The power of reachability testing for timed automata
- Forward analysis of updatable timed automata
- Checking timed Büchi automata emptiness on simulation graphs
- From MITL to Timed Automata
- The benefits of relaxing punctuality
- Reactive Systems
- Model Checking Software
- Formal Methods for the Design of Real-Time Systems
- Lectures on Concurrency and Petri Nets
This page was built for publication: Checking Timed Büchi Automata Emptiness Using LU-Abstractions
