Efficient Detection of Zeno Runs in Timed Automata
From MaRDI portal
Recommendations
- Coarse abstractions make Zeno behaviours difficult to detect
- Coarse abstractions make Zeno behaviours difficult to detect
- Static detection of Zeno runs in UPPAAL networks based on synchronization matrices and two data-variable heuristics
- How to stop time stopping
- A tool for the syntactic detection of Zeno-timelocks in timed automata
Cited in
(14)- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\)
- Entropy of regular timed languages
- A tool for the syntactic detection of Zeno-timelocks in timed automata
- Coarse abstractions make Zeno behaviours difficult to detect
- Thin and thick timed regular languages
- Efficient emptiness check for timed Büchi automata
- Static detection of Zeno runs in UPPAAL networks based on synchronization matrices and two data-variable heuristics
- Coarse abstractions make Zeno behaviours difficult to detect
- Finding minimum and maximum termination time of timed automata models with cyclic behaviour
- A menagerie of timed automata
- Distributed parametric model checking timed automata under non-zenoness assumption
- Diagnosis of timed patterns for discrete event systems by means of state isolation
- State estimation for constant-time labeled automata under dense time
- How to stop time stopping
This page was built for publication: Efficient Detection of Zeno Runs in Timed Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510844)
