The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. Its focus is on universality and flexibility, which is achieved by a technique for defining new Petri net types through Petri Net Type Definitions (PNTDs). Many business process modelling techniques are based on Petri nets. Since PNML provides a means for defining Petri net types, it might be a worthwhile pr...

Petri nets are a well established modelling technique for analyzing parallel systems. When coupled with an event-driven operating system, Petri nets can provide an effective means for integrating and controlling the functions of distributed robotic applications. Recent work has shown that Petri net graphs can also serve as remarkably intuitive operator interfaces. In this paper the advantages f...

We present a Petri net interpretation of the pi-graphs a graphical variant of the pi-calculus. Characterizing labelled transition systems, the translation can be used to reason in Petri net terms about open reconfigurable systems. We demonstrate that the pi-graphs and their translated Petri nets agree at the semantic level. In consequence, existing results on pi-graphs naturally extend to the t...

A new approach to model multi-agent systems with hierarchical colored Petri nets is introduced. Every agent has its colored Petri net system, when agents are composed into a MAS, we get hierarchical colored Petri net system of the multi-agent system, properties of the hierarchical colored Petri net system, such as reachability, deadlock detection and avoidance, fairness can be used to analyze d...

In this paper, we study the expressive power of several monotonic extensions of Petri nets. We compare the expressive power of Petri nets, Petri nets extended with nonblocking arcs and Petri nets extended with transfer arcs, in terms of ω-languages. We show that the hierarchy of expressive powers of those models is strict. To prove these results, we propose original techniques that rely on well...

In this paper, we study some classes of Petri net deenable !-languages. We consider several types of accepting conditions on Petri nets, corresponding to those considered on nite automata in the theory of !-regular languages. Then, we establish a neat correspondence between the classes of Petri net deenable !-languages and the classes of nite automata deenable !-languages. Moreover, each class ...

In this paper we present the relation between Spiking Neural P (SN P) systems and Petri nets by focusing on modeling simplex stop-and-wait protocol. The SN P system for the protocol is constructed and also translated it into equivalent Petri net with a corresponding semantics. It is then observed a direct correspondence between the Petri net representation of the proposed model and standard sol...

The aim of this paper is an introduction to the area of Petri net transformations, a rule-based approach for dynamic changes of the net structure of Petri nets. This is especially important for the stepwise construction of Petri nets in the sense of the software development process in software engineering. The concept of Petri net transformations is based on that of graph transformations and hi...

One of the primary formalisms for modeling concurrency and resource contention in systems is Petri nets. The literature on Petri nets is rich with activity on applications as well as extensions. We use the basic Petri net formalism as well as several extensions to demonstrate how metaphor can be applied to yield 3D model worlds. A number of metaphors, including 3Dprimitive and landscape are emp...

This paper presents a new two-phase approach for Petri Net based modeling of scheduling problems. Though Petri Nets have been used as heuristic approach for modeling scheduling problems, literature study reveals two major difficulties: 1) the large size of Petri Net models, and 2) the inability to differentiate workstations. In this paper, these two difficulties are avoided by a two-phase appro...