Petri nets are formal models of systems which exhibit concurrent activities. As formal models, Petri nets are bipartite directed graphs, in which the two types of vertices represent, in a very general sense, conditions and events. In order to study performance aspects of systems modeled by Petri nets, the durations of modeled activities must also be taken into account. This can be done in diffe...

Grid is one of the most e ective new paradigms in large scale distributed computing. Only recently Petri nets have been adopted as a formal modeling framework for describing the speci c aspects of the Grid. In this paper we describe a Grid tool for High Energy Physics data analysis, and we show how modeling its architecture with nets-withinnets has led us to identify and solve a number of defec...

In this paper, a new kind of deadlock-free scheduling method based on genetic algorithm and reachability analysis of timed SPR nets is proposed to solve the scheduling problems of job shop without buffers. Under the framework of timed Petri nets model, the scheduling problem can be described as finding a feasible transition firing sequence in the Petri nets model to avoid deadlock situations an...

Object based Petri nets are becoming increasingly popular in many fields of computer science. The possibility to model real-world objects as separate Petri nets supports the need for modular design of complex systems. So far object net approaches have been based on the presumption that the object nets’ structure remains unchanged in all processes. This paper sheds some light on possible extensi...

In this paper a new Petri net class for modelling and analysing joined process planning and job shop production planning is proposed based on the multi-level Petri net model introduced by [Valk 95]. The new Chameleon systems are high level nets extended with time. An unfolding construction is presented which yields an equivalent time Petri net. A time model, interval-duration interval, is propo...

Petri nets are frequently used for modeling and analysis of discrete event systems. Similar to other modeling formalisms for discrete systems, it suffers from state explosion. Fluidification can be used to overcome this difficulty yielding fluid approximation of original Petri nets in the sense of behaviours and properties. This models are called continuous Petri nets. In this work, stochastic ...

This is a tutorial paper on Petri nets. Petri nets, as a graphical and mathematical tool, provide a uniform environment for modelling, formal analysis, and design of discrete event systems. The main objective of this paper is to introduce the fundamental concepts of Petri nets to the researchers and practitioners, both from academia and industry, who are involved in the work in the areas of mod...

We examine both the modeling power of normal and sinkless Petri nets and the computational complexities of various classical decision problems with respect to these two classes. We argue that although neither normal nor sinkless Petri nets are strictly more powerful than persistent Petri nets, they nonetheless are both capable of modeling a more interesting class of problems. On the other hand,...

Nowadays workflows are extensively used by companies to improve organizational efficiency and productivity. This paper focuses on the verification of modal workflow specifications using constraint solving as a computational tool. Its main contribution consists in developing an innovative formal framework based on constraint systems to model executions of workflow Petri nets and their structural...

Hierarchical Petri nets allow a more abstract view and reconfigurable Petri nets model dynamic structural adaptation. In this contribution we present the combination of reconfigurable Petri nets and hierarchical Petri nets yielding hierarchical structure for reconfigurable Petri nets. Hierarchies are established by substituting transitions by subnets. These subnets are themselves reconfigurable...