Project Members:
Duration: since 01/2007
Project Description:
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. 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.
This allows us to solve the task of
model checking
AgentSpeak multi-agent systems by computing answer sets of the obtained logic
program with any ASP system.
Contact E-Mail: behrens[at]in.tu-clausthal.de