Reasoning About Substructures and Games

DOI10.1145/2757286zbMath1354.03019OpenAlexW2271301048MaRDI QIDQ2957764

Fabio Mogavero, Massimo Benerecetti, Aniello Murano

Publication date: 30 January 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2757286

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (6)

Practical verification of multi-agent systems against \textsc{Slk} specifications ⋮ Robust worst cases for parity games algorithms ⋮ Taming strategy logic: non-recurrent fragments ⋮ Solving parity games via priority promotion ⋮ A delayed promotion policy for parity games ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning about equilibria in game-like concurrent systems
• Logics in computer science. A study on extensions of temporal and strategic logics
• The complementation problem for Büchi automata with applications to temporal logic
• The temporal semantics of concurrent programs
• Number of quantifiers is better than number of tape cells
• Reasoning about information change
• Counting on CTL\(^*\): On the expressive power of monadic path logic
• Module checking
• Decision procedures and expressiveness in the temporal logic of branching time
• Logics of public communications
• What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
• A Behavioral Hierarchy of Strategy Logic
• Reasoning About Strategies
• Alternating-time temporal logic
• Strategy Logic
• The Complexity of Enriched Mu-Calculi
• Branching-Time Temporal Logics with Minimal Model Quantifiers
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• “Sometimes” and “not never” revisited
• Formal verification of parallel programs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Substructure Temporal Logic
• An automata-theoretic approach to branching-time model checking
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Mechanizing Mathematical Reasoning
• Automata theory and its applications
• Local equilibria in economic games

This page was built for publication: Reasoning About Substructures and Games