Merge and Conquer: State Merging in Parametric Timed Automata

DOI10.1007/978-3-319-02444-8_27zbMath1410.68194OpenAlexW2274504493MaRDI QIDQ5166701

Étienne André, Laurent Fribourg, Romain Soulat

Publication date: 8 July 2014

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-02444-8_27

zbMATH Keywords

real-time systemsstate space reductionparameter synthesis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

\textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability ⋮ Parameter synthesis for hierarchical concurrent real-time systems ⋮ Iterative bounded synthesis for efficient cycle detection in parametric timed automata ⋮ Efficient convex zone merging in parametric timed automata

Uses Software

• IMITATOR
• Uppaal
• PPL

This page was built for publication: Merge and Conquer: State Merging in Parametric Timed Automata