Modelling the Structure and Behaviour of Petri Net Agents

Köhler, Michael; Moldt, Daniel; Rölke, Heiko

doi:10.1007/3-540-45740-2_14

Cited by 64 publications

(38 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…By including attributes like autonomy, cooperation, adaptability and mobility, agents go well beyond the concept of objects and object-oriented software development. remove The multi-agent system architecture Mulan [11] is based on the nets-withinnets paradigm, which is used to describe the natural hierarchies in an agent system. Mulan is implemented in reference nets using Renew [9].…”

Section: The Multi-agent System Mulanmentioning

confidence: 99%

See 1 more Smart Citation

Applying Multi-agent Concepts to Dynamic Plug-In Architectures

Cabac

Duvigneau

Moldt

et al. 2006

Agent-Oriented Software Engineering VI

Self Cite

View full text Add to dashboard Cite

Abstract. In this work we present the basic concepts for a dynamic plug-in-based software architecture using concepts from the Petri netbased MAS framework Mulan. By transferring the concepts of agentorientation to a plug-in-based architecture we are able to design our application and the plug-in-based system on an abstract level. Moreover, general problems that evolve from a highly dynamic and configurable architecture have been solved by basing the conceptual design on multi-agent principles. In this paper we discuss the general properties of extensible systems and the benefits that can be achieved when applying the multi-agent view to their architecture. In addition to the conceptual modeling of such architectures, we provide a practical example where the concept has been successfully applied in the development of the latest release of Renew. Through the introduction of the multi-agent concepts, the new architecture is now -at runtime -dynamically extensible by registering plug-ins with the management system.

show abstract

Section: The Multi-agent System Mulanmentioning

confidence: 99%

“…Based on agent-oriented Petri nets [11] and the FIPAcompliant MAS framework Capa (see [4]) we present a conceptual model for plug-in based systems. The idea is to structure and improve such systems using important concepts from the agent-oriented area, along with a visual representation.…”

Section: Introductionmentioning

confidence: 99%

Applying Multi-agent Concepts to Dynamic Plug-In Architectures

Cabac

Duvigneau

Moldt

et al. 2006

Agent-Oriented Software Engineering VI

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since multi-agent systems (MAS) are inherently concurrent, Petri nets recommend themselves to be used in that area. In our group, we have designed a MAS architecture called Mulan (short for Mul ti Agent N ets, see [9]) with reference nets. This architecture is implemented with a mixture of nets and Java code by the Capa plug-in (C oncurrent Agent P latform Architecture, presented in [4]).…”

Section: Plug-in Examplesmentioning

confidence: 99%

An Extensible Editor and Simulation Engine for Petri Nets: Renew

Kummer

Wienberg

Duvigneau

et al. 2004

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Renew is a computer tool that supports the development and execution of object-oriented Petri nets, which include net instances, synchronous channels, and seamless Java integration for easy modelling. Renew is available free of charge including the Java source code. Due to the growing application area more and more requirements had to be fulfilled by the tool set. Therefore, the architecture of the tool has been refactored to gain more flexibility. Now new features allow for plug-ins on the level of concepts (net formalisms) and on the level of applications (e.g. workflow or agents).

show abstract

“…The model checking problem for many problems might indeed be far easier to solve than the general case presented 8 To be more concrete: The states of A φ and B φ have size quadratic in |φ| and the states of A N and B N are quadratic in |N |. 9 Note that we have already guessed µ and τ [θ], which also only have polynomial size in the size of the net.…”

Section: Discussionmentioning

confidence: 99%

“…Due to these two modelling levels object nets are very suited to model the mobility of active objects or agents (cf. [9] and [10]). …”

Section: Model Checking For Object Netsmentioning

confidence: 99%

Complexity of LTL Model-Checking for Safe Object Nets

Köhler-Bußmeier

Heitmann

EPiC Series in Computing

View full text Add to dashboard Cite

In this paper we present recently obtained results from [14] concerning the complexity of LTL model checking of safe Elementary Object Nets (Eos) in a novel and more algorithmic oriented way.Object nets are Petri nets which have Petri nets as tokens -an approach known as the nets-within-nets paradigm. Object nets are called elementary if the net system has a two levelled structure. Due to these two modelling levels object nets are very suited to model the mobility of e.g. active objects or agents. The well known p/t nets can be viewed as a special case of Eos.For p/t nets the concept of safeness means that there is at most one token on each place. Since object nets have nested markings there are different possibilities to generalise this idea for Eos. In this paper we concentrate on the variant of Eos safeness that guarantees the finiteness of state spaces and show that for safe Eos the LTL model checking problem is PSpace-complete. Model Checking for Object NetsIn the following we investigate the analysis of object nets using temporal logics. Object nets are Petri nets which have Petri nets as tokens -an approach which is called the nets-within-nets paradigm, proposed by Valk [22,24] for a two levelled structure and generalised in [11,12] for arbitrary nesting structures.1 The Petri nets that are used as tokens are called net-tokens. Net-tokens are tokens with internal structure and inner activity. Due to these two modelling levels object nets are very suited to model the mobility of active objects or agents (cf.[9] and [10]).In [12,8] we studied decidability properties of unbounded object nets. In this paper we repeat very recent results from [14] concerning bounded object nets and present them in a novel way. In particular we repeat the formalism of (safe) elementary object nets and sharpen the definitions in some points. We then prove that checking if a safe Eos satisfies a property expressed in LTL is PSpace-complete. This was first proved in [14]. We recapitulate the proof here, but take a more algorithmic oriented point of view and thus make the proof more elegant and easier to follow in several places. Throughout this paper we stress the relevance of the presented modelling formalism for the modelling of mobile objects and agents.The paper has the following structure: In Section 2 elementary object systems (Eos) are defined. In section 3 safe Eos are defined and in section 4 we discuss the complexity of LTL model checking these nets. The paper ends with a conclusion.In the following we assume basic knowledge of Petri nets, see e.g. [20].

show abstract

Modelling the Structure and Behaviour of Petri Net Agents

Cited by 64 publications

References 11 publications

Applying Multi-agent Concepts to Dynamic Plug-In Architectures

Applying Multi-agent Concepts to Dynamic Plug-In Architectures

An Extensible Editor and Simulation Engine for Petri Nets: Renew

Complexity of LTL Model-Checking for Safe Object Nets

Contact Info

Product

Resources

About