Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Reasoning about infinite computations
Information and Computation
Reasoning about knowledge
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Formalization of commitment-based agent interaction
Proceedings of the 2001 ACM symposium on Applied computing
Verifying Compliance with Commitment Protocols
Autonomous Agents and Multi-Agent Systems
A Social Semantics for Agent Communication Languages
Issues in Agent Communication
Efficient Model Checking Via Büchi Tableau Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A logical model of social commitment for agent communication
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Engineering commitment-based multiagent systems: a temporal logic approach
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
IEEE Internet Computing
Specification and verification of agent interaction protocols in a logic-based system
Proceedings of the 2004 ACM symposium on Applied computing
Annals of Mathematics and Artificial Intelligence
A Logical Model for Commitment and Argument Network for Agent Communication
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
An algebra for commitment protocols
Autonomous Agents and Multi-Agent Systems
Temporal linear logic as a basis for flexible agent interactions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Toward verification of commitment protocols and their compositions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Implementing commitment-based interactions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Artificial institutions: a model of institutional reality for open multiagent systems
Artificial Intelligence and Law
Model checking communicative agent-based systems
Knowledge-Based Systems
Amoeba: A methodology for modeling and evolving cross-organizational business processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
MCMAS: A Model Checker for the Verification of Multi-Agent Systems
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Enhancing Tropos with Commitments
Conceptual Modeling: Foundations and Applications
Semantical considerations on dialectical and practical commitments
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Commitment tracking via the reactive event calculus
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An Introduction to MultiAgent Systems
An Introduction to MultiAgent Systems
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
A concurrent dynamic logic of knowledge, belief and certainty for multi-agent systems
Knowledge-Based Systems
A new logical semantics for agent communication
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Developer-friendly verification of process-based systems
Knowledge-Based Systems
Behavior-Oriented Commitment-based Protocols
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Learning task models in ill-defined domain using an hybrid knowledge discovery framework
Knowledge-Based Systems
A multi-expert model for dialogue and behavior control of conversational robots and agents
Knowledge-Based Systems
Maximal-confirmation diagnoses
Knowledge-Based Systems
Symbolic model checking commitment protocols using reduction
DALT'10 Proceedings of the 8th international conference on Declarative agent languages and technologies VIII
On the verification of social commitments and time
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Trust measures for competitive agents
Knowledge-Based Systems
µ-SATPLAN: Multi-agent planning as satisfiability
Knowledge-Based Systems
CRM: An efficient trust and reputation model for agent computing
Knowledge-Based Systems
Verifiable semantic model for agent interactions using social commitments
LADS'09 Proceedings of the Second international conference on Languages, Methodologies, and Development Tools for Multi-Agent Systems
Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Specifying and Verifying Cross-Organizational Business Models: An Agent-Oriented Approach
IEEE Transactions on Services Computing
Verifying conformance of multi-agent commitment-based protocols
Expert Systems with Applications: An International Journal
Representing and reasoning about communicative conditional commitments
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Engineering commitment-based business protocols with the 2CL methodology
Autonomous Agents and Multi-Agent Systems
Hi-index | 0.00 |
We refine CTLC, a temporal logic of social commitments that extends CTL to allow reasoning about commitments agents create when communicating and their fulfillment. We present axioms of commitments and their fulfillment and provide the associated BDD-based model checking algorithms. We also analyze the time complexity of CTLC model checking in explicit models (i.e., Kripke-like structures) and its space complexity for concurrent programs, which provide compact representations. We prove that although CTLC extends CTL, their model checking algorithms still have the same time complexity for explicit models, which is P-complete with regard to the size of the model and length of the formula, and the same complexity for concurrent programs, which is PSPACE-complete with regard to the size of the components of these programs. We fully implemented the proposed algorithms on top of MCMAS, a model checker for the verification of multi-agent systems, and provide in this paper simulation results of an industrial case study.