Parametric Interrupt Timed Automata

DOI10.1007/978-3-642-41036-9_7zbMath1355.68148OpenAlexW15609906MaRDI 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Language Emptiness of Continuous-Time Parametric Timed Automata ⋮ Polynomial interrupt timed automata: verification and expressiveness ⋮ What’s Decidable About Parametric Timed Automata? ⋮ Revisiting reachability in polynomial interrupt timed automata ⋮ Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques

This page was built for publication: Parametric Interrupt Timed Automata