Filters








6,420 Hits in 9.1 sec

Model Checking Distributed Systems against Temporal-Epistemic Specifications [chapter]

Andreas Griesmayer, Alessio Lomuscio
2013 Lecture Notes in Computer Science  
We study this domain by analysing ABS, an executable modelling language for object-based distributed systems and present a symbolic model checking methodology for verifying ABS programs against temporal-epistemic  ...  Specifically, we show how to map an ABS program into an ISPL program for verification with MCMAS, a model checker for multi-agent systems.  ...  Alessio Lomuscio acknowledges support from the UK Engineering and Physical Sciences Research Council through the Leadership Fellowship grant "Trusted Autonomous Systems" (EP/I00520X/1).  ... 
doi:10.1007/978-3-642-38592-6_10 fatcat:hway4lc4lbefvf2w2wcinqeejy

MCMAS: A Model Checker for the Verification of Multi-Agent Systems [chapter]

Alessio Lomuscio, Hongyang Qu, Franco Raimondi
2009 Lecture Notes in Computer Science  
MCMAS [12] supports specifications based on CTL, epistemic logic (including operators of common and distributed knowledge) [7], Alternating Time Logic [2], and deontic modalities for correctness [16] .  ...  In this paper we describe MCMAS, a symbolic model checker specifically tailored to agent-based specifications and scenarios.  ...  We checked the second formula specifically to evaluate the performance of the tool against common knowledge.  ... 
doi:10.1007/978-3-642-02658-4_55 fatcat:stymco64o5ccpntc2gi2hcbmv4

MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications [article]

Petr Čermák, Alessio Lomuscio, Fabio Mogavero, Aniello Murano
2014 arXiv   pre-print
We introduce MCMAS-SLK, a BDD-based model checker for the verification of systems against specifications expressed in a novel, epistemic variant of strategy logic.  ...  We give syntax and semantics of the specification language and introduce a labelling algorithm for epistemic and strategy logic modalities.  ...  This research was partly funded by the EPSRC (grant EP/I00520X), the Regione Campania (Embedded System Cup project B25B09090 100007), the EU (FP7 project 600958-SHERPA), and the MIUR (ORCHESTRA project  ... 
arXiv:1402.2948v3 fatcat:sg3eji2l4nbirjbgda5jsgtzvy

MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications [chapter]

Petr Čermák, Alessio Lomuscio, Fabio Mogavero, Aniello Murano
2014 Lecture Notes in Computer Science  
This research was partly funded by the EPSRC (grant EP/I00520X), the Regione Campania (Embedded System Cup project B25B09090 100007), the EU (FP7 project 600958-SHERPA), and the MIUR (ORCHESTRA project  ...  The model checking problem for systems with memoryless strategies and imperfect information against ATL and ATL specifications is in PSpace [7] .  ...  MCMAS is an open-source model checker for the verification of multi-agent systems against ATL and epistemic operators.  ... 
doi:10.1007/978-3-319-08867-9_34 fatcat:hzvqaskzpnax3ausps2gxpzwym

A Tool For Specification And Verification Of Epistemic Properties In Interpreted Systems

Franco Raimondi, Alessio Lomuscio
2004 Electronical Notes in Theoretical Computer Science  
We show how an SMV model checker can be coupled with a Kripke model editor (Akka) to allow for the mechanical verification of epistemic properties of multi-agent systems.  ...  We present a compiler that translates a multi-agent systems specification given in the formalism of Interpreted Systems into an SMV program.  ...  Specifically, we have here presented a tool for model checking epistemic formulae in multi-agent systems.  ... 
doi:10.1016/s1571-0661(05)82609-x fatcat:xdhxgq3ia5aolely43bmgy77ui

Model Checking Temporal Epistemic Logic under Bounded Recall

Francesco Belardinelli, Alessio Lomuscio, Emily Yu
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We define and study the model checking problem against CTLK specifications under incomplete information and bounded recall and present complexity upper bounds.  ...  We study the problem of verifying multi-agent systems under the assumption of bounded recall. We introduce the logic CTLKBR, a bounded-recall variant of the temporal-epistemic logic CTLK.  ...  It is known that model checking systems against temporal-epistemic specifications under incomplete information and perfect recall is NON-ELEMENTARY without the common knowledge modality (Dima 2008) .  ... 
doi:10.1609/aaai.v34i05.6193 fatcat:cfsvzkpstnd4ldezsts5rezikm

To know or not to know: epistemic approaches to security protocol verification

Francien Dechesne, Yanjing Wang
2010 Synthese  
On the other hand, we discuss the cost of the epistemic operators in terms of model checking complexity.  ...  Security properties naturally combine temporal aspects of protocols with aspects of knowledge of the agents.  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided  ... 
doi:10.1007/s11229-010-9765-8 fatcat:ymd2ak35cbe2nejnh2eqp7dxtm

Model Checking Systems Against Epistemic Specifications

Alessio R. Lomuscio
2014 Electronic Proceedings in Theoretical Computer Science  
To do so we introduce a further temporal-epistemic logic, called EHS RE , in which regular expressions are used within propositions, and give a polynomial time reduction of the model checking problem from  ...  We investigate the complexity of verifying multi-agent systems against EHS + specifications for a number of fragments of EHS + with results ranging from PSPACE-completeness to non-elementary time.  ...  Model checking ISRLs against EHS + BDE specifications is decidable and PSPACE-complete. Proof.  ... 
doi:10.4204/eptcs.146.0.3 fatcat:56n3cvwokfe4hjswl2al3ta2p4

A Computationally Grounded, Weighted Doxastic Logic

Taolue Chen, Giuseppe Primiero, Franco Raimondi, Neha Rungta
2015 Studia Logica: An International Journal for Symbolic Logic  
We provide model checking algorithms, complexity characterisations and a prototype implementation.  ...  Modelling, reasoning and verifying complex situations involving a system of agents is crucial in all phases of the development of a number of safety-critical systems.  ...  checking algorithm; new tool release, now publicly available at http://www.rmnd.net.  ... 
doi:10.1007/s11225-015-9621-4 fatcat:gzsf4uclpnd6zimk52hoebdw3y

MCMAS: an open-source model checker for the verification of multi-agent systems

Alessio Lomuscio, Hongyang Qu, Franco Raimondi
2015 International Journal on Software Tools for Technology Transfer (STTT)  
MCMAS supports efficient symbolic techniques for the verification of multi-agent systems against specifications representing temporal, epistemic and strategic properties.  ...  We present MCMAS, a model checker for the verification of multi-agent systems.  ...  Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecomm ons.org/licenses/by/4.0/), which permits unrestricted use, distribution  ... 
doi:10.1007/s10009-015-0378-x fatcat:4ahtmrxx7ndq5jg2zghtsf3zn4

Automated Verification of Resource Requirements in Multi-Agent Systems Using Abstraction [chapter]

Natasha Alechina, Brian Logan, Hoang Nga Nguyen, Abdur Rakib
2011 Lecture Notes in Computer Science  
The framework allows the use of abstract specifications consisting of Linear Time Temporal Logic (LTL) formulas to specify some of the agents in the system.  ...  We describe a framework for the automated verification of multi-agent systems which do distributed problem solving, e.g., query answering.  ...  We also showed how to further improve scalability by using abstract agents specified in terms of temporal epistemic formulas. The tool described in the paper is a simple prototype.  ... 
doi:10.1007/978-3-642-20674-0_5 fatcat:aftljqldkvhw3ly2chdkbqoaai

Automatic verification of temporal-epistemic properties of cryptographic protocols

Ioana Boureanu, Mika Cohen, Alessio Lomuscio
2009 Journal of Applied Non-Classical Logics  
We define a translation from CAPSL models into interpreted systems, a popular semantics for temporal-epistemic logic, and rewrite CAPSL goals as temporal-epistemic specifications.  ...  The compiler links to the symbolic model checker MCMAS.  ...  for multi-agent systems supporting temporal-epistemic specifications.  ... 
doi:10.3166/jancl.19.463-487 fatcat:3d64n7sqjfa73gqccmfaw3juwq

mcmas: A Model Checker for Multi-agent Systems [chapter]

Alessio Lomuscio, Franco Raimondi
2006 Lecture Notes in Computer Science  
Differently from traditional model checkers, MCMAS permits the automatic verification of specifications that use epistemic, correctness, and cooperation modalities, in addition to the standard temporal  ...  This paper presents MCMAS, a model checker for Multi-Agent Systems (MAS).  ...  Discussion Differently from previous approaches [2] , MCMAS does not involve the translation nor the reduction of the model checking problem for MAS to other available model checkers.  ... 
doi:10.1007/11691372_31 fatcat:6ppepf2fyvacragtsy57eoynk4

Tractable multiagent planning for epistemic goals

Wiebe van der Hoek, Michael Wooldridge
2002 Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 3 - AAMAS '02  
We present a novel approach to this problem, in which the problem is formulated as one of model checking in Alternating Temporal Epistemic Logic (ATEL).  ...  We then describe how this example was implemented using the MOCHA model checking system, and conclude by discussing the relationship of our work with that of others in the planning and speech acts communities  ...  ALTERNATING TEMPORAL EPISTEMIC LOGIC Alternating epistemic transition systems are the structures we use to model the systems of interest to us.  ... 
doi:10.1145/545056.545095 dblp:conf/atal/HoekW02 fatcat:qs7oatgxjbgjraudkng72cxadi

Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems

J. Ezekiel, A. Lomuscio
2017 Information and Computation  
of temporal-epistemic specifications.  ...  We define a general method for mutating a multi-agent systems model representing correct behaviour by injecting faults into it, and specification patterns based on temporal-epistemic formulas to reason  ...  The mutated model is verified against temporal-epistemic specifications to reason about the correct and faulty behaviours of the MAS, in order to assess properties of fault tolerance, recoverability, and  ... 
doi:10.1016/j.ic.2016.10.007 fatcat:nawb5ycwbfbllgatwldzkkhkmu
« Previous Showing results 1 — 15 out of 6,420 results