Reasoning About Substructures and Games

DOI10.1145/2757286MaRDI QIDQ2957764zbMATH OpenOpenAlexFDO

Authors Massimo Benerecetti, Fabio Mogavero, 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

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

Recommendations

• Games with sequential backtracking and complete game semantics for subclassical logics
• Logic and games on automatic structures. Playing with quantifiers and decompositions
• scientific article; zbMATH DE number 1808198
• scientific article; zbMATH DE number 2014522
• Game characterizations of logic program properties
• Games in algebraic logic: axiomatisations and beyond
• Reasoning about games
• Game semantics for constructive modal logic
• scientific article; zbMATH DE number 7594123
• Substructural logics: a primer

Cites work

• A behavioral hierarchy of strategy logic
• A course in game theory.
• Alternating-time logic with imperfect recall
• Alternating-time temporal logic
• An automata-theoretic approach to branching-time model checking
• Automata theory and its applications
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Branching-Time Temporal Logics with Minimal Model Quantifiers
• Counting on CTL^*: On the expressive power of monadic path logic
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Decision procedures and expressiveness in the temporal logic of branching time
• Formal verification of parallel programs
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 4027441 (Why is no real title available?)
• scientific article; zbMATH DE number 3757688 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 3993549 (Why is no real title available?)
• scientific article; zbMATH DE number 2090317 (Why is no real title available?)
• scientific article; zbMATH DE number 3212004 (Why is no real title available?)
• Local equilibria in economic games
• Logics in computer science. A study on extensions of temporal and strategic logics
• Logics of public communications
• Mechanizing Mathematical Reasoning
• Module checking
• Number of quantifiers is better than number of tape cells
• Reasoning about equilibria in game-like concurrent systems
• Reasoning about information change
• Reasoning about strategies
• Reasoning about strategies: on the model-checking problem
• Strategy Logic
• Substructure Temporal Logic
• The complementation problem for Büchi automata with applications to temporal logic
• The Complexity of Enriched Mu-Calculi
• The temporal semantics of concurrent programs
• What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
• “Sometimes” and “not never” revisited

Cited in

(7)

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

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

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