Language Emptiness of Continuous-Time Parametric Timed Automata
From MaRDI portal
Publication:3449466
DOI10.1007/978-3-662-47666-6_6zbMath1440.68150arXiv1504.07838OpenAlexW1946664948MaRDI QIDQ3449466
Nikola Beneš, Peter Bezděk, Jiří Srba, Kim Guldstrand Larsen
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07838
Related Items (15)
\textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability ⋮ Language Emptiness of Continuous-Time Parametric Timed Automata ⋮ Parametric Deadlock-Freeness Checking Timed Automata ⋮ On clock-aware LTL parameter synthesis of timed automata ⋮ Unnamed Item ⋮ LTL Parameter Synthesis of Parametric Timed Automata ⋮ Language Preservation Problems in Parametric Timed Automata ⋮ Distributed parametric model checking timed automata under non-zenoness assumption ⋮ Parametric updates in parametric timed automata ⋮ What’s Decidable About Parametric Timed Automata? ⋮ Unnamed Item ⋮ Consistency in parametric interval probabilistic timed automata ⋮ Timed automata relaxation for reachability ⋮ Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints* ⋮ Context-free timed formalisms: robust automata and linear temporal logics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric timing analysis for real-time systems
- Improved undecidability results on weighted timed automata
- Robust parametric reachability for timed automata
- Decision problems for lower/upper bound parametric timed automata
- A theory of timed automata
- Advances in Parametric Real-Time Reasoning
- Language Emptiness of Continuous-Time Parametric Timed Automata
- An Inverse Method for Parametric Timed Automata
- Parametric Interrupt Timed Automata
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Parametric real-time reasoning
- Integer Parameter Synthesis for Timed Automata
- Boundedness problems for Minsky counter machines
This page was built for publication: Language Emptiness of Continuous-Time Parametric Timed Automata
