Taming strategy logic: non-recurrent fragments

Cites Work

On the freeze quantifier in Constraint LTL: Decidability and complexity
On the semantics of strategy logic
Augmenting ATL with strategy contexts
Strategy logic
Using branching time temporal logic to synthesize synchronization skeletons
Automata-theoretic techniques for modal logics of programs
The temporal semantics of concurrent programs
The polynomial-time hierarchy
Infinite games played on finite graphs
The complexity of propositional linear temporal logics in simple cases
Automata, logics, and infinite games. A guide to current research
Dependences in strategy logic
Decision procedures and expressiveness in the temporal logic of branching time
Iterated Boolean games
What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
Reasoning About Strategies
Reasoning About Substructures and Games
Relentful Strategic Reasoning in Alternating-Time Temporal Logic
Strategies in Games: A Logic-Automata Study
Dependences in Strategy Logic
Alternating-time temporal logic
ATL* Satisfiability Is 2EXPTIME-Complete
Strategy Logic
Solving Games Without Determinization
Automatic verification of finite-state concurrent systems using temporal logic specifications
“Sometimes” and “not never” revisited
The complexity of propositional linear temporal logics
Alternation
A Decision Procedure for the First Order Theory of Real Addition with Order
Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
A CTL* Model Checker for Petri Nets
Substructure Temporal Logic
Weighted Strategy Logic with Boolean Goals Over One-Counter Games.
Binding Forms in First-Order Logic
An automata-theoretic approach to branching-time model checking
Automata theory and its applications
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item

This page was built for publication: Taming strategy logic: non-recurrent fragments