Parametric Interrupt Timed Automata

DOI10.1007/978-3-642-41036-9_7MaRDI QIDQ5168513zbMATH OpenOpenAlexFDO

Authors Béatrice Bérard, Serge Haddad, Didier Lime, 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)

Recommendations

• Interrupt Timed Automata
• Interrupt timed automata with auxiliary clocks and parameters
• Polynomial interrupt timed automata
• Interrupt timed automata: verification and expressiveness
• Hybrid Systems: Computation and Control
• Timed P Automata
• Timed P Automata
• Timed P automata
• Timed automata

Cited in

(9)

• Revisiting reachability in polynomial interrupt timed automata
• Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques
• Polynomial interrupt timed automata: verification and expressiveness
• scientific article; zbMATH DE number 1670792 (Why is no real title available?)
• Interrupt timed automata with auxiliary clocks and parameters
• Language emptiness of continuous-time parametric timed automata
• What's decidable about parametric timed automata?
• Integer Parameter Synthesis for Timed Automata
• Robust parametric reachability for timed automata

This page was built for publication: Parametric Interrupt Timed Automata

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