On completeness of liveness synthesis for parametric timed automata (Extended Abstract)

DOI10.1007/978-3-030-73785-6_1OpenAlexW3154685813MaRDI QIDQ2237334

Laure Petrucci, Jaco van de Pol

Publication date: 27 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-73785-6_1

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Iterative bounded synthesis for efficient cycle detection in parametric timed automata

Cites Work

• Decision problems for lower/upper bound parametric timed automata
• Integer-complete synthesis for bounded parametric timed automata
• Linear parametric model checking of timed automata
• Parametric verification: an introduction
• Iterative bounded synthesis for efficient cycle detection in parametric timed automata
• LTL Parameter Synthesis of Parametric Timed Automata
• Parametric real-time reasoning

This page was built for publication: On completeness of liveness synthesis for parametric timed automata (Extended Abstract)