Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...

The paper describes a formal procedure to construct a Petri net model starting from the differential equations that describe the behavior of a canal network. In a first approach, the equations are discretized and the corresponding model takes the form of a deterministic timed Petri net. In a second approach, timed continuous Petri nets are used. The dynamic behavior of the system can be studied...

There is an increasing interest both in the Object-Oriented and the Petri net community for an integration of the concepts of the two approaches. Although the proposals for « objects and Petri nets » are numerous and widely different, there seems to be two major trends « Objects inside Petri net » versus « Petri net inside Objects ». We state here the basic paradigm of these two trends, and bri...

We define encodings of a Process Hitting into a Petri Net and conversely. It results notably that • the Process Hitting is a sub-class of Petri Nets; • any safe Petri Net can be encoded into a weakly-bisimilar Process Hittings with 3 priority classes. We finally discuss the use of the encoding of a Petri Net into a Process Hitting for providing efficient static analysis of dynamical properties.

in this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition petri nets. the mobile agent system contains two mobile agents called dca and una. it sends out agents to update antivirus on client computers in a network. each agent takes on a specified responsibility. first, dca roams through the network and check the last d...

In this paper, we address the problem of expressing objectoriented concepts in terms of Petri nets. This is interesting, first, as a possibility of representing concurrent system specifications written in object-oriented formalisms or languages with Petri nets, and second, as a way of allowing automated verification of the obtained Petri net using existing reachability analysis tools. We start ...

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 ...

The effectiveness of Petri nets for the modelling of reactive systems is demonstrated through the use of a class of non-autonomous hierarchical high-level Petri nets, named by Hierarchical Reactive Petri Nets. The translation between the Petri net model and executable code is presented and shown to be simple and direct allowing a smooth two-way automatic translation process between specificatio...

Petri nets have been proposed as a suitable tool for expressing precedence constraints and computing assembly sequences. Motivations for using Petri nets stem from their clear and well-deened semantics as well as from the formal analysis tools and techniques available. In this paper the operation and properties of Petri net models representing assembly plans are reconnected to the fundamental p...