Parametric Interrupt Timed Automata
From MaRDI portal
Publication:5168513
DOI10.1007/978-3-642-41036-9_7zbMath1355.68148MaRDI QIDQ5168513
Didier Lime, Serge Haddad, Béatrice Bérard, Aleksandra Ž. Jovanović
Publication date: 7 July 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-41036-9_7
68Q45: Formal languages and automata
Related Items
What’s Decidable About Parametric Timed Automata?, Revisiting reachability in polynomial interrupt timed automata, Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques, Polynomial interrupt timed automata: verification and expressiveness, Language Emptiness of Continuous-Time Parametric Timed Automata