Computing maximally-permissive strategies in acyclic timed automata

DOI10.1007/978-3-030-57628-8_7OpenAlexW3082306462MaRDI QIDQ1996019FDOQ1996019

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