Computing maximally-permissive strategies in acyclic timed automata
From MaRDI portal
Publication:1996019
DOI10.1007/978-3-030-57628-8_7OpenAlexW3082306462MaRDI QIDQ1996019
Nicolas Markey, David Mentré, Emily Clement, Thierry Jéron
Publication date: 2 March 2021
Full work available at URL: https://arxiv.org/abs/2007.01815
Related Items (1)
Cites Work
- Robust reachability in timed automata and games: a game-based approach
- A theory of timed automata
- Dynamical properties of timed automata
- Computing maximally-permissive strategies in acyclic timed automata
- Robust Controller Synthesis in Timed Automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Robust controller synthesis in timed Büchi automata: a symbolic approach
This page was built for publication: Computing maximally-permissive strategies in acyclic timed automata
