A finite word is called Petri net solvable if it is isomorphic to the reachability graph of some unlabelled Petri net. In this paper, the class of two-letter Petri net solvable words is studied.

W u d As automated manufacturing systems become more complex, the need for an effective design tool to p d u c e both high level Discrete Event Control System (DECS) and low level implementation, becomes increasingly more important Petri nets represent the most effective method for both the design and implementation of DECSs. The conversion of such Petri nets into ml-time applications has mnt l...

In the continuing research towards characterizing 1-safe Petri nets with n-places and generating all the 2n binary n-vectors as marking vectors exactly once, the problem of determine minimum Petri nets; 'minimum' in the sense that the number of transitions is kept minimum possible for the generation of all the 2n binary n-vectors has been found. In this paper, the existence and unique...

It is a well-known fact that for every k-safe Petri net, i.e. a Petri net in which no place contains more than k 2 N tokens under any reachable marking, there is a 1-safe Petri net with the same interleaving behaviour. Indeed these types of Petri nets generate regular languages. In this paper, we show that this equivalence of k-safe and 1-safe Petri nets holds also for their pomset languages, a...

This paper presents basic guidelines for building Petri net ontology, which should enable using Petri nets on the Semantic Web and help establish a true Web community of Petri net users and applications. Available Petri net model descriptions give format definitions. Their main objective is to provide the syntax for sharing Petri net models between different applications. Some of these applicat...

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

It is not easy to analyze the physical system with Petri net if the system is large-scaled and complex, mainly because the structure of the Petri net model is also complex. In order to overcome this difficulty, a decomposition method of Petri net based on an index function of places is introduced, with which a set of well-formed and structure-simple sub net systems can be obtained. For all the ...

In this paper, Hybrid Petri Nets are proposed as a modelling methodology to control production in a large class of manufacturing processes. A hybrid Petri net (HPN) is a combination of a ‘classical’ Petri net and a continuous Petri net, the ‘fluid’ version of a timed Petri net. The two parts of an HPN can affect each other. In the particular model proposed, the discrete part of the HPN ‘regulat...

The power of Petri nets resides on the availability of several tools for analysis and verification of properties of systems. Users have to combine the functionality of tools in different applications to take their advantages and overcome their disadvantages in order to solve complex problems that can't be solved using a single tool. This combination is difficult, because each tool has its own P...

This article presents several diierent kinds of Petri nets, together with computer tools based on them, and compares possibilities of their application in the area of simulation and modelling. Place/transition Petri nets, stochastic Petri nets, hierarchical coloured Petri nets and nally object oriented Petri nets are mentioned here. As for the tools, Design/CPN, TimeNET, LOOPN++ and PNtalk are ...