Automata-theoretic decision of timed games
Authors:
- Marco FaellaMFMarco Faella
- Salvatore La TorreSTSalvatore La Torre
- Aniello MuranoAMAniello Murano
- 1 January 2014
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 515, 46-63
Abstract
No abstract availableKeywords
Funding Information
- GNCS
- European Union 7th Framework Program (600958-SHERPA)
- MIUR
This publication has 20 references indexed in Scilit:
- O-Minimal Hybrid Reachability GamesLogical Methods in Computer Science, 2010
- Modular strategies for recursive game graphsTheoretical Computer Science, 2006
- Optimal paths in weighted timed automataTheoretical Computer Science, 2004
- Deterministic generators and games for Ltl fragmentsACM Transactions on Computational Logic, 2004
- Finite automata on timed ω-treesTheoretical Computer Science, 2003
- Alternating-time temporal logicJournal of the ACM, 2002
- Parametric temporal logic for “model measuring”ACM Transactions on Computational Logic, 2001
- A theory of timed automataTheoretical Computer Science, 1994
- Automata-theoretic techniques for modal logics of programsJournal of Computer and System Sciences, 1986
- Using branching time temporal logic to synthesize synchronization skeletonsScience of Computer Programming, 1982