Integer-complete synthesis for bounded parametric timed automata
From MaRDI portal
Publication:1675143
DOI10.1007/978-3-319-24537-9_2zbMath1471.68111MaRDI QIDQ1675143
Didier Lime, Olivier H. Roux, Étienne André
Publication date: 27 October 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-24537-9_2
68Q45: Formal languages and automata
Related Items
What’s Decidable About Parametric Timed Automata?, Unnamed Item, Unnamed Item, Efficient convex zone merging in parametric timed automata, On completeness of liveness synthesis for parametric timed automata (Extended Abstract)