2007
DOI: 10.1007/s10472-008-9092-7
|View full text |Cite
|
Sign up to set email alerts
|

Model checking multi-agent systems with logic based Petri nets

Abstract: We introduce a class of Petri nets, simple logic Petri nets (SLPN), that are based on logical expressions. We show how this type of nets can be efficiently mapped into logic programs with negation: the corresponding answer sets describe interleaved executions of the underlying nets (Theorem 1). The absence of an answer set indicates a deadlock situation. We also show how to correctly model and specify AgentSpeak agents and multi-agent systems with SLPN's (Theorem 2). Both theorems allow us to solve the task of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(17 citation statements)
references
References 21 publications
0
17
0
Order By: Relevance
“…In the past, other authors worked already on connecting agents with Petri nets [21][22][23], especially for model checking reasons, but the models they proposed do not primarily focus on agent cognition. This work essentially aims to start filling this gap.…”
Section: Discussion and Further Developmentsmentioning
confidence: 99%
“…In the past, other authors worked already on connecting agents with Petri nets [21][22][23], especially for model checking reasons, but the models they proposed do not primarily focus on agent cognition. This work essentially aims to start filling this gap.…”
Section: Discussion and Further Developmentsmentioning
confidence: 99%
“…Many of the models in the areas of social simulation, self-organisation, ant computing, and swarm intelligence belong to this class, and often are purely behavioural, described in a reactive manner by stimulus-response-like associations; the complexity emerges from the interaction of large numbers of such simple agents, and the environment. [5] (logical); [3], [42], [56] (numerical); [11], [13], [17], [1], [46], [32], [37], [51], [58], [60], [61], [36] (hybrid); [4], [21], [6], [7], [10] (transitions, automata, Petri nets) behavioural [52], [53], [26], [14] (social simulation, swarm intelligence); [27] (emotion contagion); [54] (analysis)…”
Section: Discussion and Classification Of Existing Modelsmentioning
confidence: 99%
“…clusterbased internal [11] (crime); [20] (organisation); [38], [45] (joint goals and intentions); [2], [37], [43] (epidemics) behavioural [34], [29], [41], [35], [28], [9] (organisation); [49], [57], [62] (ecological) temporally global agentbased internal [47], [24], [25], [64], [63], [48] (requirements); [31], [50], [59], [4], [21], [6], [7], [10], [12], [40] (verification) behavioural clusterbased internal [24], [25], [34], [29], [30], [41], [36], [18], [55], [64], [65] (requirements, enterprise); [43], [2], [37] (epidemics); [49], [57], …”
Section: Discussion and Classification Of Existing Modelsmentioning
confidence: 99%
“…In respect to MAS theory, this connection has been exploited already in AgentSpeak(L) (Rao, 1996), a logic programming language for cognitive agents, extended and operationally implemented in the platform Jason (Bordini et al, 2007). The connection of AgentSpeak(L) with Petri nets has been extensively studied in (Behrens and Dix, 2008), with the purpose of performing MAS model checking using Petri nets. In the present work, however, we have a completely different objective: we started from a representation of the scenario on a MSC chart, we refined it with Petri nets patterns, and now we want to extract from this representation the correspondent agent-role descriptions (as agent programs).…”
Section: Computational Implementationmentioning
confidence: 99%