Automata-theoretic decision of timed games

DOI10.1016/J.TCS.2013.08.021MaRDI QIDQ386611zbMATH OpenOpenAlexFDO

Authors 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 logictimed gamestree automata

Mathematics Subject Classification ID

Temporal logic (03B44) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 2086509
• Reachability-Time Games on Timed Automata
• A game approach to determinize timed automata
• Formal Modeling and Analysis of Timed Systems
• Satisfiability games for branching-time logics

Cites work

• A theory of timed automata
• Alternating-time temporal logic
• ATL with strategy contexts: expressiveness and model checking
• Automatic synthesis of switching controllers for linear hybrid systems: safety control
• Computer Aided Verification
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Decision problems for lower/upper bound parametric timed automata
• Deterministic generators and games for LTL fragments
• Enriched MU-Calculi Module Checking
• Finite automata on timed \(\omega\)-trees
• Formal Modeling and Analysis of Timed Systems
• scientific article; zbMATH DE number 3492660 (Why is no real title available?)
• scientific article; zbMATH DE number 1303059 (Why is no real title available?)
• scientific article; zbMATH DE number 1361131 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 2080198 (Why is no real title available?)
• scientific article; zbMATH DE number 1775458 (Why is no real title available?)
• scientific article; zbMATH DE number 2086509 (Why is no real title available?)
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)
• Model-checking in dense real-time
• Modular strategies for recursive game graphs
• Module checking
• O-minimal hybrid reachability games
• On the synthesis of strategies in infinite games
• Optimal bounds in parametric LTL games
• Optimal paths in weighted timed automata
• Parametric Metric Interval Temporal Logic
• Parametric temporal logic for “model measuring”
• Program Complexity in Hierarchical Module Checking
• Pushdown module checking
• Pushdown module checking with imperfect information
• Reachability-Time Games on Timed Automata
• Reasoning about infinite computations
• Reasoning about strategies
• Robust reachability in timed automata: a game-based approach
• Strategy logic
• Timed tree automata with an application to temporal logic.
• Using branching time temporal logic to synthesize synchronization skeletons
• What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic

Cited in

(7)

• A game approach to determinize timed automata
• A game approach to determinize timed automata
• Combining symbolic representations for solving timed games
• scientific article; zbMATH DE number 6862072 (Why is no real title available?)
• scientific article; zbMATH DE number 2086509 (Why is no real title available?)
• A unifying approach to decide relations for timed automata and their game characterization
• Reachability-Time Games on Timed Automata

This page was built for publication: Automata-theoretic decision of timed games

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