Computing maximally-permissive strategies in acyclic timed automata

DOI10.1007/978-3-030-57628-8_7MaRDI QIDQ1996019zbMATH OpenOpenAlexFDO

Authors Emily Clement, Thierry Jéron, Nicolas Markey, David Mentré

Publication date 2 March 2021

Full work available at URL https://arxiv.org/abs/2007.01815

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A theory of timed automata
• Computing maximally-permissive strategies in acyclic timed automata
• Dynamical properties of timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Robust Controller Synthesis in Timed Automata
• Robust controller synthesis in timed Büchi automata: a symbolic approach
• Robust reachability in timed automata and games: a game-based approach

Cited in

(1)

• Computing maximally-permissive strategies in acyclic timed automata

This page was built for publication: Computing maximally-permissive strategies in acyclic timed automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996019)