scientific article; zbMATH DE number 7350779
From MaRDI portal
Publication:4989408
Étienne André, Mathias Ramparison, Didier Lime
Publication date: 25 May 2021
Full work available at URL: https://arxiv.org/abs/1904.08824
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
timed automatadecidabilityparametric timed automataclock regionsparametric difference bound matrixparametric updates
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Robust parametric reachability for timed automata
- Decision problems for lower/upper bound parametric timed automata
- What's decidable about hybrid automata?
- A theory of timed automata
- TCTL model checking lower/upper-bound parametric timed automata without invariants
- Linear parametric model checking of timed automata
- Updatable timed automata
- Symbolic quantitative robustness analysis of timed automata
- On model-checking timed automata with stopwatch observers
- Relationships between nondeterministic and deterministic tape complexities
- Shrinking timed automata
- Advances in Parametric Real-Time Reasoning
- Optimal Reachability in Divergent Weighted Timed Games
- Parametric real-time reasoning
- Lectures on Concurrency and Petri Nets
This page was built for publication: