In the area of Petri nets, many diierent developments have taken place within the last 30 years, in academia as well as in practice. For an adequate use in practice, a coherent and application oriented combination of various types and techniques for Petri nets is necessary. In order to attain a formal basis for diierent classes of Petri nets we introduce the concept of abstract Petri nets. The ...

Reset Petri nets extend Petri nets by allowing transitions to empty places, in addition with the usual adding of removing of constants. A Reset Petri net is normalized if the ow function over the Petri arcs (labeled with integers) and the initial state are valuated into f0; 1g. In this paper, we give an eecient method to turn a general Reset Petri net into a-bisimilar normalized Reset Petri net...

In this paper we study how it is possible to control Petri net behavior using time constrains. Controlling here means forcing a process to behave in a stable way by associating time intervals to transitions and hence transforming a classic Petri net into a Time Petri net. For Petri net models stability is often ensured by liveness and boundedness. These properties are crucial in many applicatio...

Biological systems are often very complex so that an appropriate formalism is needed for modeling their behavior. Hybrid Petri nets, consisting of timediscrete as well as continuous Petri net elements, have proven to be ideal. This formalism was implemented based on the Modelica language. Several Petri net components are structured within an advanced Petri net library. A special sub-library con...

The achievement of media synchronization has been dealt with in the Object Composition Petri Net (OCPN) model and the extended OCPN (XOCPN) model. Yet these two models are not enough for synchronization of computers in a distributed environment. This paper proposes a new Petri Net model—Prioritized Petri Net (Pnet). The modeling power and properties of P-nets are analyzed. We apply the P-net mo...

We propose MPath2PN, a tool which automatically translates metabolic pathways, as described in the major biological databases, into corresponding Petri net representations. The aim is to allow for a systematic reuse, in the setting of metabolic pathways, of the variety of tools existing for Petri net analysis and simulation. The current prototype implementation of MPath2PN inputs the KEGG descr...

Given an arbitrary Petri net structure, which may have uncontrollable and unobservable transitions, the liveness enforcement procedure presented here determines a set of linear inequalities on the marking of a Petri net. When the Petri net is supervised so that its markings satisfy these inequalities, the supervised net is proved to be live for all initial markings that satisfy the supervision ...

A context-free grammar and its derivations can be described by a Petri net, called a context-free Petri net, whose places and transitions correspond to the nonterminals and the production rules of the grammar, respectively, and tokens are separate instances of the nonterminals in a sentential form. Therefore, the control of the derivations in a context-free grammar can be implemented by adding ...

We introduce a semidecidable procedure which, given a Petri net structure and a set T of transitions, synthesizes a supervisor enforcing the transitions in T to be live. We call this liveness property T -liveness. When T equals the total set of Petri net transitions, T -liveness corresponds to liveness. Enforcing only a subset of transitions to be live is useful when some Petri net transitions ...

In this paper the dynamic modeling of repairable and standby components of complex systems is analyzed using Petri Nets and ladder logic diagrams. The use of Petri Nets as modelling of a complex system avoids two basic disadvantages of Markov chain analysis. First, the Petri Net model does not grow in size as increasing the number of components and second, Markov chain has been limited to the e...