Continuous Petri nets are a relaxation of classical discrete Petri nets in which transitions can be fired a fractional number of times, and consequently places may contain a fractional number of tokens. Such continuous Petri nets are an appealing object to study since they over approximate the set of reachable configurations of their discrete counterparts, and their reachability problem is know...

The development of provably error-free concurrent systems is still a challenge of practical system engineering. Modelling and analysis of concurrent systems by means of Petri nets is one of the well-known approaches using formal methods. Among those Petri net analysis techniques suitable for strong verification purposes there is an increasing amount of promising methods avoiding the constructio...

Time Petri Nets (TPN) are Petri Net based models augmented with timing information by associating an interval to each transition. The ring time of a transition is chosen non-deterministically (but not in a stochastic manner) from its associated interval. This paper presents a technique to check if a TPN satis es temporal properties expressed in real-time Computational Tree Logic (RTCTL). The tr...

A Petri net is an abstract formal model of the behavior of a system and information flow. The properties, concepts, and techniques of Petri net are so as to present it as a simple and strong method for describing and analyzing information flow and systems control. Fuzzy Petri Net (FPN) is an appropriate powerful model to emulate knowledge base systems using fuzzy rules. Yet, FPN model does not ...

In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the synthesis of Petri nets from (step) transition systems. Partial order semantics of a concrete net (of a certain type) usually are given by the set of labelled partial orders (LPOs) enabled w.r.t. the net. For classical p...

Petri nets represent a modeling paradigm which allows to build general models by using a small number of graphical primitives. The strong point of Petri nets lies in their ability to model system aspects such as concurrency and synchronization and to represent these aspects graphically. Due to this reason, stochastic Petri nets (SPNs) are frequently used for model-based performance and dependab...

We consider the modelling of the behaviour of membrane systems using Petri nets. First, a systematic, structural, link is established between a basic class of membrane systems and Petri nets. To capture the compartmentisation of membrane systems, localities are proposed as an extension of Petri nets. This leads to a locally maximal concurrency semantics for Petri nets. We indicate how processes...

As p-calculus based on the interleaving semantics cannot depict the true concurrency and has few supporting tools, it is translated into Petri nets. p-calculus is divided into basic elements, sequence, concurrency, choice and recursive modules. These modules are translated into Petri nets to construct a complicated system. Petri nets semantics for p-calculus visualize system structure as well a...

Petri nets have become a mature modelling and analysis tool applicable in many application domains. Since the introduction of the Petri net concept in 1962 (Petri 14]), Petri nets have been investigated and applied by many researchers. Many extensions of the classical Petri net have been proposed. To model attributes, `colour' has been added. Time concepts have been added to describe the tempor...