M. Benerecetti and A. Cimatti. Symbolic model checking for multi agent systems. In Proceedings of the ICLP'01 workshop on Computational Logic in Multi-Agent Systems, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Model Checking AgentSpeak - Bordini, Fisher, Pardavila.. (18 citations) (Correct)
....in AgentSpeak(L) Model checking techniques have only recently begun to find a significant audience in the multi agent systems community. Rao and Georgeff developed basic algorithms for model checking BDI logics [14] but the authors proposed no method for generating BDI models from programs. In [1], a general approach for modelchecking multi agent systems was proposed, based on the branching temporal logic CTL together with modalities for BDI like attitudes. However, once again no method was given for generating models from actual systems, and so the techniques given there could not easily ....
M. Benerecetti and A. Cimatti. Symbolic model checking for multi-agent systems. In Proc. ECAI Workshop on Model Checking and Artificial Intelligence (MoChArt-2002.
Verification of Payment Protocols via MultiAgent.. - Benerecetti, Panti.. (2002) Self-citation (Benerecetti) (Correct)
....Springer Verlag Berlin Heidelberg 2002 312 M. Benerecetti et al. both time and belief (thus it follows the line of the work based on logics of belief or knowledge and does not use any model of the intruder) but verification is performed by means of a symbolic model checker (called NuMAS [3], a model checker based on NuSMV [9] NuMAS is built on the work described in [6] where model checking is applied to BDI attitudes (i.e. Belief, Desire, and Intention) of agents. Our work aims at the use of MATL for modeling payment protocols and uses NuMAS for their verification. This ....
....The te poral evolution of the propositional ato s sendP X and rec X can be derived directly fro the protocol description. The behavior of the other ato s derives fro the axio s described in Section 3. The reader can refer to [4, 5] for a description of how the views can be odeled in NuMAS and to [3]fora description of the sy bolic odel checking algorith for MATL. Here we report 324 M. Benerecetti et al. Tab l e 1 . The verification of the Lu and Smolka protocol View Specification Result C(16)False C(17)True M(18)False M(19)True M(20)True P(21)False P(22)False the results of the ....
M. Benerecetti and A. Cimatti. Symbolic Model Checking for Multi--Agent Systems. In CLIMA-2001, Workshop on Computational Logic in Multi-Agent Systems, Paphos, Cyprus, December 1st 2001. Co-located with ICLP'01. 312, 323
Model Checking a Knowledge Exchange - Scenario Sieuwert Van (Correct)
No context found.
M. Benerecetti and A. Cimatti. Symbolic model checking for multi agent systems. In Proceedings of the ICLP'01 workshop on Computational Logic in Multi-Agent Systems, 2001.
Verifiable Multi-Agent Programs - Bordini, Fisher, Visser, Wooldridge (Correct)
No context found.
M. Benerecetti and A. Cimatti. Symbolic model checking for multi-agent systems. In Proceedings of the Model Checking and Arti cial Intelligence Workshop (MoChArt-2002.
Computational Logic in Multi-Agent Systems: recent advances and.. - Torroni (2003) (Correct)
No context found.
Benerecetti, M. and A. Cimatti: 2001, `Symbolic Model Checking for MultiAgent Systems'. in [21]. Electronic proceedings.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC