Language preservation problems in parametric timed automata
From MaRDI portal
Publication:5208876
zbMATH Open1429.68098arXiv1807.07091MaRDI QIDQ5208876FDOQ5208876
Authors: Étienne André, Didier Lime, Nicolas Markey 
Publication date: 22 January 2020
Full work available at URL: https://arxiv.org/abs/1807.07091
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
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A theory of timed automata
- Title not available (Why is that?)
- Relationships between nondeterministic and deterministic tape complexities
- Lectures on Concurrency and Petri Nets
- Title not available (Why is that?)
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- Parametric real-time reasoning
- Robust safety of timed automata
- Decision problems for lower/upper bound parametric timed automata
- Linear parametric model checking of timed automata
- Shrinking timed automata
- Title not available (Why is that?)
- Advances in Parametric Real-Time Reasoning
- Untimed Language Preservation in Timed Systems
- Robustness of time Petri nets under guard enlargement
- Integer Parameter Synthesis for Timed Automata
- Robust parametric reachability for timed automata
- Learning-based compositional parameter synthesis for event-recording automata
- TCTL model checking lower/upper-bound parametric timed automata without invariants
- Integer-complete synthesis for bounded parametric timed automata
- The language preservation problem is undecidable for parametric event-recording automata
- Language preservation problems in parametric timed automata
Cited In (11)
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability
- Efficient convex zone merging in parametric timed automata
- Untimed Language Preservation in Timed Systems
- Language emptiness of continuous-time parametric timed automata
- The language preservation problem is undecidable for parametric event-recording automata
- Language preservation problems in parametric timed automata
- What's decidable about parametric timed automata?
- Distributed parametric model checking timed automata under non-zenoness assumption
- On the expressiveness of parametric timed automata
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
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 Q5208876)
