The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Intention is choice with commitment
Artificial Intelligence
First-order logic and automated theorem proving
First-order logic and automated theorem proving
Handbook of theoretical computer science (vol. B)
Reasoning about knowledge
Reasoning about knowledge: a survey
Handbook of logic in artificial intelligence and logic programming (Vol. 4)
Multiagent systems: a modern approach to distributed artificial intelligence
Multiagent systems: a modern approach to distributed artificial intelligence
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the menbership problem for functional and multivalued dependencies in relational databases
ACM Transactions on Database Systems (TODS)
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Modal logic
Modal and temporal properties of processes
Modal and temporal properties of processes
Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Dynamic Logic
Introduction to Multiagent Systems
Introduction to Multiagent Systems
Alternating-time temporal logic
Journal of the ACM (JACM)
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Model Checking CTL+ and FCTL is Hard
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Verifying epistemic properties of multi-agent systems via bounded model checking
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Logic in Computer Science: Modelling and Reasoning about Systems
Logic in Computer Science: Modelling and Reasoning about Systems
A modal characterization of Nash equilibrium
Fundamenta Informaticae
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
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
Model checking discounted temporal properties
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Complete axiomatization and decidability of alternating-time temporal logic
Theoretical Computer Science
On the complexity of practical ATL model checking
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Advances in Verification of Time Petri Nets and Timed Automata: A Temporal Logic Approach (Studies in Computational Intelligence)
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
From Bounded to Unbounded Model Checking for Temporal Epistemic Logic
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Update and Abstraction in Model Checking of Knowledge and Branching Time
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Alternating-time temporal logics with irrevocable strategies
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Alternating-time temporal logic with explicit strategies
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Model Checking Abilities of Agents: A Closer Look
Theory of Computing Systems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Essentials of Game Theory: A Concise, Multidisciplinary Introduction
Essentials of Game Theory: A Concise, Multidisciplinary Introduction
A Temporal Logic for Stochastic Multi-Agent Systems
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
VerICS 2007 - a Model Checker for Knowledge and Real-Time
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Reasoning about temporal properties of rational play
Annals of Mathematics and Artificial Intelligence
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
What Agents Can Probably Enforce
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Easy Yet Hard: Model Checking Strategies of Agents
Computational Logic in Multi-Agent Systems
On Epistemic Temporal Strategic Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
√erics: a tool for verifying timed automata and estelle specifications
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Strategic planning for probabilistic games with incomplete information
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Strategic games and truly playable effectivity functions
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Do agents make model checking explode (computationally)?
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
Verifying multi-agent systems via unbounded model checking
FAABS'04 Proceedings of the Third international conference on Formal Approaches to Agent-Based Systems
Alternating epistemic Mu-calculus
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
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
Autonomous Agents and Multi-Agent Systems
On the Boundary of Behavioral Strategies
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Overview. Multi agent systems (MAS) provide an important framework for formalizing various problems in computer science, artificial intelligence, game theory, social choice theory, etc. Modal logics are amongst the most suitable and versatile logical formalisms for specification and verification of computational systems. Here, we present an overview of some important developments in the area. We introduce modal logics used for specification of temporal, epistemic, and strategic properties of systems; then, we present some model checking algorithms, and discuss the computational complexity of the model checking problem. Finally, we consider symbolic (compact) representations of systems based on Binary Decision Diagrams (BDD) and propositional logic formulas, and show how the representations change the algorithmic side of model checking. We also discuss other techniques that help to reduce the complexity and make the verification feasible even for large systems.