Message Sequence Chart (MSC) is a graphical trace language for describing the communication behaviour of distributed systems. In order to build a Petri Net model of a complex system, this paper introduces a strategy to build a Petri Net model by using MSC. The algorithm of translating the MSC model to Petri Net model is also given in this paper. We can get the Petri Net model and improve it by ...

This paper presents a Petri net based analysis of ontology for indoor location-based services. The proposed method builds up a Petri net model for the given ontology at the first step. Then, it analyzes the Petri net model by running the simulation on it. The proposed method of building a Petri net model for the given ontology is given in the paper. Then algorithms of performing inferences on t...

A Markovian Petri net is a stochastic discrete event system frequently used for analysis and performance evaluation purposes. In the past, the fluidification has been proposed as a relaxation technique for avoiding the ”state explosion problem”. Following the same approach, in this paper a hybrid Petri net model is defined as a partial relaxation of an original Markovian Petri net. It is shown ...

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.

Veriication of parallel programs is a very important goal on the way to improve the reliability of software. The PEP tool, a Programming Environment based on Petri nets, allows veriication of parallel programs by partial order model checking based on a compositional denotational Petri net semantics. The language supported by the PEP tool covers block structuring, parallel and sequential composi...

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