Parametric updates in parametric timed automata
From MaRDI portal
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- A theory of timed automata
- Advances in Parametric Real-Time Reasoning
- Decision problems for lower/upper bound parametric timed automata
- scientific article; zbMATH DE number 1759608 (Why is no real title available?)
- scientific article; zbMATH DE number 1444359 (Why is no real title available?)
- scientific article; zbMATH DE number 7297846 (Why is no real title available?)
- Language preservation problems in parametric timed automata
- Lectures on Concurrency and Petri Nets
- Linear parametric model checking of timed automata
- MTL-model checking of one-clock parametric timed automata is undecidable
- On model-checking timed automata with stopwatch observers
- Optimal reachability in divergent weighted timed games
- Parametric real-time reasoning
- Relationships between nondeterministic and deterministic tape complexities
- Robust parametric reachability for timed automata
- Shrinking timed automata
- Symbolic quantitative robustness analysis of timed automata
- TCTL model checking lower/upper-bound parametric timed automata without invariants
- Updatable timed automata
- What's decidable about hybrid automata?
Cited in
(4)
This page was built for publication: Parametric updates in parametric timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989408)