What’s Decidable About Parametric Timed Automata?
From MaRDI portal
Publication:4686606
DOI10.1007/978-3-319-29510-7_3zbMath1396.68064arXiv1907.01721OpenAlexW2296504218MaRDI QIDQ4686606
Publication date: 2 October 2018
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.01721
Related Items (2)
The language preservation problem is undecidable for parametric event-recording automata ⋮ Iterative bounded synthesis for efficient cycle detection in parametric timed automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Low dimensional hybrid systems -- decidable, undecidable, don't know
- Robust parametric reachability for timed automata
- Timed verification of the generic architecture of a memory circuit using parametric timed automata
- Decision problems for lower/upper bound parametric timed automata
- What's decidable about hybrid automata?
- A theory of timed automata
- Symbolic model checking for real-time systems
- Integer-complete synthesis for bounded parametric timed automata
- Uppaal in a nutshell
- Linear parametric model checking of timed automata
- Bounded Model Checking for Parametric Timed Automata
- Advances in Parametric Real-Time Reasoning
- Language Preservation Problems in Parametric Timed Automata
- Language Emptiness of Continuous-Time Parametric Timed Automata
- Parametric temporal logic for “model measuring”
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- The expressive power of clocks
- Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points
- Robustness in Timed Automata
- Parametric Interrupt Timed Automata
- Parametric real-time reasoning
- Real-Time Model-Checking: Parameters everywhere
This page was built for publication: What’s Decidable About Parametric Timed Automata?
