scientific article; zbMATH DE number 7155172
From MaRDI portal
Publication:5208876
zbMath1429.68098arXiv1807.07091MaRDI QIDQ5208876
Didier Lime, Nicolas Markey, Étienne André
Publication date: 22 January 2020
Full work available at URL: https://arxiv.org/abs/1807.07091
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
\textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability ⋮ Unnamed Item ⋮ Distributed parametric model checking timed automata under non-zenoness assumption ⋮ Unnamed Item ⋮ Efficient convex zone merging in parametric timed automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust parametric reachability for timed automata
- Robust safety of timed automata
- Decision problems for lower/upper bound parametric timed automata
- A theory of timed 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
- Linear parametric model checking of timed automata
- Relationships between nondeterministic and deterministic tape complexities
- Shrinking Timed Automata.
- Advances in Parametric Real-Time Reasoning
- Language Preservation Problems in Parametric Timed Automata
- Untimed Language Preservation in Timed Systems
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- Robustness of Time Petri Nets under Guard Enlargement
- Learning-Based Compositional Parameter Synthesis for Event-Recording Automata
- Parametric real-time reasoning
- Integer Parameter Synthesis for Timed Automata
- Lectures on Concurrency and Petri Nets
This page was built for publication:
