An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
JMOCHA: a model checking tool that exploits design structure
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Independence-friendly modal logic and true concurrency
Nordic Journal of Computing
An Approach to Composition Motivated by wp
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
Combining Forward and Backward Analyses of Temporal Properties
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Faster Model Checking for Open Systems
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Executable Protocol Specification in ESL
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Distributed Controller Synthesis for Local Specifications
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Model Checking: A Tutorial Overview
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Fate and Free Will in Error Traces
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Automata-Theoretic Decision of Timed Games
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Exploiting Hierarchical Structure for Efficient Formal Verification
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Hybrid Systems' Properties - Classification and Relation to Computer Science
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Independence: Logics and Concurrency
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Trading Probability for Fairness
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Agents and Roles: Refinement in Alternating-Time Temporal Logic
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Model checking: a tutorial overview
Modeling and verification of parallel processes
Enforcing behavior with contracts
Programming methodology
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Game Analysis of Abuse-free Contract Signing
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Concurrent dynamic epistemic logic for MAS
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
A game-based verification of non-repudiation and fair exchange protocols
Journal of Computer Security - IFIP 2000
Deterministic generators and games for Ltl fragments
ACM Transactions on Computational Logic (TOCL)
Properties of Hybrid Systems—A Computer Science Perspective
Formal Methods in System Design
CTR-S: a logic for specifying contracts in semantic web services
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Coalition games and alternating temporal logics
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Fully Symbolic Unbounded Model Checking for Alternating-time Temporal Logic1
Autonomous Agents and Multi-Agent Systems
A logic for strategic reasoning
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
The value of privacy: optimal strategies for privacy minded agents
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
A logic of reasoning, communication and cooperation with syntactic knowledge
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Modular decomposition of complex interactions using games networks
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
A static compliance-checking framework for business process models
IBM Systems Journal
A Logical Analysis of the Interaction between `Obligation-to-do' and `Knowingly Doing'
DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
A Logic for Reasoning about Rational Agents
Computational Logic in Multi-Agent Systems
A Complete STIT Logic for Knowledge and Action, and Some of Its Applications
Declarative Agent Languages and Technologies VI
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
Declarative Agent Languages and Technologies VI
A Tableau Decision Procedure for ALC With Monotonic Modal Operators and Constant Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about temporal properties of rational play
Annals of Mathematics and Artificial Intelligence
A logic of games and propositional control
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Towards an ontology of agency and action From STIT to OntoSTIT+
Proceedings of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006)
Issues in Designing Logical Models for Norm Change
Organized Adaption in Multi-Agent Systems
Modeling Agents' Knowledge in Collective Evolutionary Systems
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part I
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Tableau-based decision procedures for logics of strategic ability in multiagent systems
ACM Transactions on Computational Logic (TOCL)
Easy Yet Hard: Model Checking Strategies of Agents
Computational Logic in Multi-Agent Systems
Logic for automated mechanism design: a progress report
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On the Logic of Cellular Reactive Systems
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
On Epistemic Temporal Strategic Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal analysis and improvement of multi-party non-repudiation protocol
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Coping with shame and sense of guilt: a Dynamic Logic Account
Autonomous Agents and Multi-Agent Systems
On the relationship between playing rationally and knowing how to play: a logical account
KI'06 Proceedings of the 29th annual German conference on Artificial intelligence
Information flow in concurrent games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the expressiveness and complexity of ATL
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Attributing distributed responsibility in stit logic
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
DEON'10 Proceedings of the 10th international conference on Deontic logic in computer science
An automata-theoretic approach to infinite-state systems
Time for verification
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
Qualitative concurrent parity games
ACM Transactions on Computational Logic (TOCL)
Program synthesis in administration of higher-order permissions
Proceedings of the 16th ACM symposium on Access control models and technologies
A framework for coalitional normative systems
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Model checking strategic abilities of agents under incomplete information
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Elementary modules in games networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Model-checking timed ATL for durational concurrent game structures
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
Strategic deontic temporal logic as a reduction to ATL, with an application to chisholm's scenario
DEON'06 Proceedings of the 8th international conference on Deontic Logic and Artificial Normative Systems
SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction
Reachability games for linear hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
DALT'11 Proceedings of the 9th international conference on Declarative Agent Languages and Technologies
State and path coalition effectivity models for logics of multi-player games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Secure programming via visibly pushdown safety games
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Compositional verification and 3-valued abstractions join forces
SAS'07 Proceedings of the 14th international conference on Static Analysis
Timed concurrent game structures
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Complexity Results of STIT Fragments
Studia Logica
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While linear-time and branching-time logics are natural specification languages for closed systems, alternating-time logics are natural specification languages for open systems. For example, by preceding the temporal operator ``eventually'' with a selective path quantifier, we can specify that in the game between the system and the environment, the system has a strategy to reach a certain state. Also the problems of receptiveness, realizability, and controllability can be formulated as model-checking problems for alternating-time formulas. Depending on whether we admit arbitrary nesting of selective path quantifiers and temporal operators, we obtain the two alternating-time temporal logics ATL and ATL*. We interpret the formulas of ATL and ATL* with respect to two models of composition for open systems, synchronous and asynchronous. For synchronous systems, the expressive power of ATL beyond CTL comes at no cost: the model-checking complexity of synchronous ATL is linear in the size of the system and the length of the formula. The symbolic model-checking algorithm for CTL extends with few modifications to synchronous ATL, and with some work, also to asynchronous ATL, whose model-checking complexity is quadratic. This makes ATL an obvious candidate for the automatic verification of open systems. In the case of ATL*, the model-checking problem is closely related to the synthesis problem for linear-time formulas, and requires doubly exponential time for both synchronous and asynchronous systems.