Language preservation problems in parametric timed automata
From MaRDI portal
Recommendations
- 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?
- On the expressiveness of parametric timed automata
- Language emptiness of continuous-time parametric timed automata
Cites work
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- Decision problems for lower/upper bound parametric timed automata
- scientific article; zbMATH DE number 177824 (Why is no real title available?)
- scientific article; zbMATH DE number 1444359 (Why is no real title available?)
- Language emptiness of continuous-time parametric timed automata
- Language preservation problems in parametric timed automata
- Linear parametric model checking of timed automata
- Parametric real-time reasoning
- Robust safety of timed automata
- Robustness in timed automata
- Untimed Language Preservation in Timed Systems
Cited in
(8)- 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
- Untimed Language Preservation in Timed Systems
- Language emptiness of continuous-time parametric timed automata
- On the expressiveness of parametric timed automata
- What's decidable about parametric timed automata?
- Language preservation problems in parametric timed automata
This page was built for publication: Language preservation problems in parametric timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945580)