Zone-based verification of timed automata: extrapolations, simulations and what next?
From MaRDI portal
Publication:2112098
DOI10.1007/978-3-031-15839-1_2OpenAlexW4293399526MaRDI QIDQ2112098
B. Srivathsan, Patricia Bouyer, Ocan Sankur, Paul Gastin, Frédéric Herbreteau
Publication date: 18 January 2023
Full work available at URL: https://arxiv.org/abs/2207.07479
Uses Software
Cites Work
- Better abstractions for timed automata
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
- Fast zone-based algorithms for reachability in pushdown timed automata
- Partial-order reduction techniques for real-time model checking
- A theory of timed automata
- Symbolic model checking for real-time systems
- Lazy reachability checking for timed automata using interpolants
- Timed-automata abstraction of switched dynamical systems using control invariants
- Forward analysis of updatable timed automata
- Updatable timed automata
- Model checking for probabilistic timed automata
- On the optimal reachability problem of weighted timed automata
- SMT-based scenario verification for hybrid systems
- Optimal infinite scheduling for multi-priced timed automata
- Task automata: Schedulability, decidability and undecidability
- Timed-Automata Abstraction of Switched Dynamical Systems Using Control Funnels
- Improving Search Order for Reachability Testing in Timed Automata
- Timed automata with observers under energy constraints
- Better Abstractions for Timed Automata
- SAT-Based Model Checking without Unrolling
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
- Checking Timed Büchi Automata Emptiness Using LU-Abstractions
- Symbolic Optimal Reachability in Weighted Timed Automata
- Why Liveness for Timed Automata Is Hard, and What We Can Do About It
- Improved BDD-Based Discrete Analysis of Timed Systems
- SMT-Based Induction Methods for Timed Systems
- Why Liveness for Timed Automata Is Hard, and What We Can Do About It
- Parametric real-time reasoning
- Tools and Algorithms for the Construction and Analysis of Systems
- Lectures on Concurrency and Petri Nets
- CONCUR 2005 – Concurrency Theory
- Formal Modeling and Analysis of Timed Systems
- Analysis of timed systems using time-abstracting bisimulations
- Abstraction refinement algorithms for timed automata
- Fast algorithms for handling diagonal constraints in timed automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Zone-based verification of timed automata: extrapolations, simulations and what next?
