Supervisory Control and High-level Petri nets

The Supervisory Control Theory (SCT) (Ramadge & Wonham, 1989) was developed to provide a formal methodology for the automatic synthesis of controllers for Discrete Event Systems (DES). In this theory, a system, called a plant, is assumed to have uncontrollable behaviours which may violate some desired specifications. Hence, these behaviours have to be controlle

Analysing Coloured Petri Nets by the Occurrence Graph Method

This paper provides an overview og the work done for the author's PhD thesis. The research area of Coloured Petri Nets is introduced, and the available analysis methods are presented. The occurrence graph method, which is the main subject of this thesis, is described in more detail. Summaries of the six papers which, together with this overview, comprise the thesis are given, and the contributions are discussed.A large portion of this overview is dedicated to a description of related work. The aim is twofold: First, to survey pertinent results within the research areas of -- in increasing generality -- Coloured Petri Nets, High-level Petri Nets, and formalisms for modelling and analysis of parallel and distributed systems. Second, to put the results obtained in this thesis in a wider perspective by comparing them with important related work

Efficient reachability graph representation of Petri nets with unbounded counters

International audienceIn this paper, we define a class of Petri nets, called Petri nets with counters, that can be seen as place/transition Petri nets enriched with a vector of integer variables on which linear operations may be applied. Their semantics usually leads to huge or infinite reachability graphs. Then, a more compact representation for this semantics is defined as a symbolic state graph whose nodes possibly encode infinitely many values for the variables. Both representations are shown behaviourally equivalent

Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters

AbstractIn this paper, we define a class of Petri nets, called Petri nets with counters, that can be seen as place/transition Petri nets enriched with a vector of integer variables on which linear operations may be applied. Their semantics usually leads to huge or infinite reachability graphs. Then, a more compact representation for this semantics is defined as a symbolic state graph whose nodes possibly encode infinitely many values for the variables. Both representations are shown behaviourally equivalent

Towards a Petri net Model for Graph Transformation Systems

Graph transformation systems (GTS) have been successfully proposed as a general, theoretically sound model for concurrency. Petri nets (PN), on the other side, are a central and intuitive formalism for concurrent or distributed systems, well supported by a number of analysis techniques/tools. Some PN classes have been shown to be instances of GTS. In this paper, we change perspective presenting an operational semantics of GTS in terms of Symmetric Nets, a well-known class of Coloured Petri nets featuring a structured syntax that outlines model symmetries. Some practical exploitations of the proposed operational semantics are discussed. In particular, a recently developed structural calculus for SN is used to validate graph rewriting rules in a symbolic way

Proceedings of SUMo and CompoNet 2011

International audienc

TIME EXTENSIONS OF PETRI NETS FOR MODELLING AND YERIFICATION OF HARD REAL-TIME SYSTEMS

The main aim ofthepaper is apresentation oftime extensions ofPetri nets appropriate for modelling and analysis o f hard real-time systems. It is assumed, that the extensions must provide a model o f time flow, an ability to force a transition to fire within a stated timing constraint (the so-called the strongfiring rule), and timing constraints represented by inte- rvals. The presented survey includes extensions o f classical Place/Transition Petri nets, as well as the ones applied to high-level Petri nets. An expressiveness o f each time extension is illustrated using simple hard real-time system. The paper includes also a brief description o f analysis and verification methods related to the extensions, and a survey o f software tools supporting modelling and analysis o f the considered Petri nets