Efficient convex zone merging in parametric timed automata
From MaRDI portal
Publication:2112120
DOI10.1007/978-3-031-15839-1_12OpenAlexW4293399549MaRDI QIDQ2112120
Jaco van de Pol, Étienne André, Dylan Marinho, Laure Petrucci
Publication date: 18 January 2023
Full work available at URL: https://arxiv.org/abs/2212.04802
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Better abstractions for timed automata
- Efficient emptiness check for timed Büchi automata
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
- A theory of timed automata
- Integer-complete synthesis for bounded parametric timed automata
- Linear parametric model checking of timed automata
- Iterative bounded synthesis for efficient cycle detection in parametric timed automata
- PPLite: zero-overhead encoding of NNC polyhedra
- Improving Search Order for Reachability Testing in Timed Automata
- Efficient Bounded Reachability Computation for Rectangular Automata
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- LTL Parameter Synthesis of Parametric Timed 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
- Tools and Algorithms for the Construction and Analysis of Systems
- On Interleaving in Timed Automata
- An efficient abstract domain for not necessarily closed polyhedra
This page was built for publication: Efficient convex zone merging in parametric timed automata
