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

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

Authors: Jaco van de Pol, Laure Petrucci 

Publication date: 27 October 2021

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

Recommendations

• Iterative bounded synthesis for efficient cycle detection in parametric timed automata
• Formal Modeling and Analysis of Timed Systems
• Integer-complete synthesis for bounded parametric timed automata
• LTL parameter synthesis of parametric timed automata
• Integer Parameter Synthesis for Timed Automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (2)

• Iterative bounded synthesis for efficient cycle detection in parametric timed automata
• Presburger liveness verification of discrete timed automata.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2237334)