Alternating-time temporal logic
From MaRDI portal
Publication:3455546
DOI10.1145/585265.585270zbMath1326.68181OpenAlexW2048905609WikidataQ64059056 ScholiaQ64059056MaRDI QIDQ3455546
Orna Kupferman, Thomas A. Henzinger, Rajeev Alur
Publication date: 7 December 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cis_reports/102
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (only showing first 100 items - show all)
Model-checking for resource-bounded ATL with production and consumption of resources ⋮ An Algorithm for Probabilistic Alternating Simulation ⋮ Modular strategies for recursive game graphs ⋮ Complete axiomatization and decidability of alternating-time temporal logic ⋮ Ten Problems of Deontic Logic and Normative Reasoning in Computer Science ⋮ Specification and Verification of Multi-Agent Systems ⋮ An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking ⋮ Automata Theory and Model Checking ⋮ Compositional Reasoning ⋮ The mu-calculus and Model Checking ⋮ Graph Games and Reactive Synthesis ⋮ Cooking Your Own Parity Game Preorders Through Matching Plays ⋮ Admissible Strategies in Infinite Games over Graphs ⋮ From Parity and Payoff Games to Linear Programming ⋮ Strict Divergence for Probabilistic Timed Automata ⋮ Coalition Description Logic with Individuals ⋮ A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic ⋮ The Complexity of One-Agent Refinement Modal Logic ⋮ On Satisfiability in ATL with Strategy Contexts ⋮ Reasoning about Agent Programs Using ATL-Like Logics ⋮ Qualitative Approximate Behavior Composition ⋮ Verifying Systems of Resource-Bounded Agents ⋮ Logics with group announcements and distributed knowledge: completeness and expressive power ⋮ A logic for conditional local strategic reasoning ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ Weighted Automata on Infinite Words in the Context of Attacker-Defender Games ⋮ The synthesis problem for repeatedly communicating Petri games ⋮ Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Dependences in Strategy Logic ⋮ Mean-payoff games with \(\omega\)-regular specifications ⋮ Robust worst cases for parity games algorithms ⋮ Reasoning About Strategies ⋮ Infinite-duration poorman-bidding games ⋮ Cooperative concurrent games ⋮ Reasoning About Substructures and Games ⋮ Model checking open systems with alternating projection temporal logic ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Tracking and managing deemed abilities ⋮ Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism ⋮ DEL-based epistemic planning: decidability and complexity ⋮ Automated temporal equilibrium analysis: verification and synthesis of multi-player games ⋮ A logic of goal-directed knowing how ⋮ Agents necessitating effects in Newtonian time and space: from power and opportunity to effectivity ⋮ On the determinacy of concurrent games on event structures with infinite winning sets ⋮ Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol ⋮ Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking ⋮ A Note on Game Theory and Verification ⋮ On the logic of cooperation and propositional control ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Hierarchical Network Formation Games ⋮ Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra ⋮ Concurrent reachability games ⋮ Planning-based knowing how: a unified approach ⋮ Epistemic GDL: a logic for representing and reasoning about imperfect information games ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability ⋮ Strategies, model checking and branching-time properties in Maude ⋮ Positive monotone modal logic ⋮ Automatic verification of competitive stochastic systems ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ A survey of partial-observation stochastic parity games ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Model checking abilities of agents: a closer look ⋮ Compositional verification and 3-valued abstractions join forces ⋮ A dynamic logic of agency. I: STIT, capabilities and powers ⋮ Action and knowledge in alternating-time temporal logic ⋮ Qualitative criteria of admissibility for enforced agreements ⋮ On Robot Games of Degree Two ⋮ Dynamic resource allocation games ⋮ Knowing-how under uncertainty ⋮ Natural strategic ability ⋮ Approximate verification of strategic abilities under imperfect information ⋮ Robust Equilibria in Mean-Payoff Games ⋮ On Memoryless Quantitative Objectives ⋮ Dynamic Resource Allocation Games ⋮ A Temporal Logic for the Interaction of Strategies ⋮ Alternating-Time Temporal Announcement Logic ⋮ Synthesizing Strategies for Homogenous Multi-Agent Systems with Incomplete Information ⋮ Reasoning about Joint Action and Coalitional Ability in K n with Intersection ⋮ Verifying Team Formation Protocols with Probabilistic Model Checking ⋮ Dynamic Restriction of Choices: Synthesis of Societal Rules ⋮ On a Logic for Coalitional Games with Priced-Resource Agents ⋮ An Epistemic Predicate CTL* for Finite Control π-Processes ⋮ On timeline-based games and their complexity ⋮ A Formal Treatment of Agents, Goals and Operations Using Alternating-Time Temporal Logic ⋮ The model checking fingerprints of CTL operators ⋮ Decidability and Expressivity of Ockhamist Propositional Dynamic Logics ⋮ Łukasiewicz logics for cooperative games ⋮ A propositional dynamic logic for instantial neighborhood semantics ⋮ Can we build it: formal synthesis of control strategies for cooperative driver assistance systems ⋮ On obligations and normative ability: Towards a logical analysis of the social contract ⋮ Alternating-time temporal logic ATL with finitely bounded semantics ⋮ Representing and reasoning about game strategies ⋮ Qualitative analysis of concurrent mean-payoff games ⋮ Uniform strategies, rational relations and jumping automata ⋮ Reasoning about memoryless strategies under partial observability and unconditional fairness constraints ⋮ A logic with revocable and refinable strategies ⋮ Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems ⋮ A Compositional Automata-based Approach for Model Checking Multi-Agent Systems ⋮ The complexity of automated addition of fault-tolerance without explicit legitimate states
This page was built for publication: Alternating-time temporal logic
