Iterative bounded synthesis for efficient cycle detection in parametric timed automata
From MaRDI portal
Publication:2044207
DOI10.1007/978-3-030-72016-2_17zbMath1467.68078OpenAlexW3138868504MaRDI QIDQ2044207
Laure Petrucci, Étienne André, Jaco van de Pol, Jaime Arias
Publication date: 4 August 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-72016-2_17
Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
Tweaking the odds in probabilistic timed automata ⋮ \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability ⋮ Distributed parametric model checking timed automata under non-zenoness assumption ⋮ On completeness of liveness synthesis for parametric timed automata (Extended Abstract) ⋮ Efficient convex zone merging in parametric timed automata
Cites Work
- Unnamed Item
- Checking timed Büchi automata emptiness efficiently
- A theory of timed automata
- Linear parametric model checking of timed automata
- Proving the existence of fair paths in infinite-state systems
- On completeness of liveness synthesis for parametric timed automata (Extended Abstract)
- Bounded Model Checking for Parametric Timed Automata
- From MITL to Timed Automata
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- Checking Timed Büchi Automata Emptiness Using LU-Abstractions
- LTL Parameter Synthesis of Parametric Timed Automata
- What’s Decidable About Parametric Timed Automata?
- Efficient On-the-Fly Emptiness Check for Timed Büchi Automata
- Why Liveness for Timed Automata Is Hard, and What We Can Do About It
- Merge and Conquer: State Merging in Parametric Timed Automata
- Parametric real-time reasoning
This page was built for publication: Iterative bounded synthesis for efficient cycle detection in parametric timed automata
