Language Preservation Problems in Parametric Timed Automata
From MaRDI portal
Publication:2945580
DOI10.1007/978-3-319-22975-1_3zbMath1465.68129MaRDI QIDQ2945580
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
68Q45: Formal languages and automata
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
What’s Decidable About Parametric Timed Automata?, Unnamed Item, The language preservation problem is undecidable for parametric event-recording automata, Consistency in parametric interval probabilistic timed automata, Language Preservation Problems in Parametric 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