Automata-theoretic decision of timed games

DOI10.1016/j.tcs.2013.08.021zbMath1301.68177MaRDI QIDQ386611

Marco Faella, Salvatore La Torre, Aniello Murano

Publication date: 10 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.08.021

zbMATH Keywords

temporal logic; tree automata; timed games

Mathematics Subject Classification ID

91A05: 2-person games

91A43: Games involving graphs

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

03B44: Temporal logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic synthesis of switching controllers for linear hybrid systems: safety control
• Optimal paths in weighted timed automata
• Model-checking in dense real-time
• Pushdown module checking
• Strategy logic
• Decision problems for lower/upper bound parametric timed automata
• Using branching time temporal logic to synthesize synchronization skeletons
• A theory of timed automata
• Reasoning about infinite computations
• Finite automata on timed \(\omega\)-trees
• Timed tree automata with an application to temporal logic.
• Module checking
• Pushdown module checking with imperfect information
• Modular strategies for recursive game graphs
• What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
• Robust Reachability in Timed Automata: A Game-Based Approach
• Alternating-time temporal logic
• Enriched MU-Calculi Module Checking
• Parametric temporal logic for “model measuring”
• Parametric Metric Interval Temporal Logic
• On the synthesis of strategies in infinite games
• O-Minimal Hybrid Reachability Games
• Deterministic generators and games for Ltl fragments
• Reachability-Time Games on Timed Automata
• Program Complexity in Hierarchical Module Checking
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Formal Modeling and Analysis of Timed Systems
• Computer Aided Verification