Language Preservation Problems in Parametric Timed Automata

DOI10.1007/978-3-319-22975-1_3zbMath1465.68129OpenAlexW1824805445MaRDI QIDQ2945580

Étienne André, Nicolas Markey

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22975-1_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Unnamed Item ⋮ Language Preservation Problems in Parametric Timed Automata ⋮ The language preservation problem is undecidable for parametric event-recording automata ⋮ What’s Decidable About Parametric Timed Automata? ⋮ Consistency in parametric interval probabilistic timed automata

Cites Work

• Unnamed Item
• Unnamed Item
• Robust safety of timed automata
• Decision problems for lower/upper bound parametric timed automata
• Linear parametric model checking of timed automata
• Language Preservation Problems in Parametric Timed Automata
• Untimed Language Preservation in Timed Systems
• Language Emptiness of Continuous-Time Parametric Timed Automata
• AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
• Robustness in Timed Automata
• Parametric real-time reasoning