Jensen, K. And G. Rozenberg (1991). High Level Petri Nets: Theory

High-level Petri nets are now widely used in both theoretical analysis and practical modelling of concurrent systems. The main reason for the success of this class of net models is that they make it possible to obtain much more succinct and manageable de­ scriptions than can be obtained by means of low-level Petri nets-while, on the other hand, they still offer a wide range of analysis methods and tools.

This book provides essential information on Petri net theory and Petri net-based model checking methods. As for the Petri net theory, it involves the interleaving semantics and concurrency semantics of elementary net systems, some important net structures (e.g., invariant, repetitive vector, siphon, and trap), some classical net subclasses with special structures (e.g., state machine, marked graph, free-choice net,asymmetric-choice net, normal net, and weakly persistent net), and some basic properties (e.g., reachability, liveness, deadlock, and soundness).

Hardware Design and Petri Nets presents a summary of the state of the art in the applications of Petri nets to designing digital systems and circuits. The area of hardware design has traditionally been a fertile field for research in concurrency and Petri nets. Many new ideas about modelling and analysis of concurrent systems, and Petri nets in particular, originated in theory of asynchronous digital circuits. Similarly, the theory and practice of digital circuit design have always recognized Petri nets as a powerful and easy-to-understand modelling tool..

At first glance the concepts of time and of Petri nets are quite contrary: while time determines the occurrences of events in a system, classic Petri nets consider their causal relationships and they represent events as concurrent systems. But if we take a closer look at how time and causality are intertwined we realize that there are many possible ways in which time and Petri nets interact. This book takes a closer look at three time-dependent Petri nets: Time Petri nets, Timed Petri nets, and Petri nets with time windows.

These Transactions publish archival papers in the broad area of Petri nets and other models of concurrency, ranging from theoretical work to tool support and industrial applications. ToPNoC issues are published as LNCS volumes, and hence are widely distributed and indexed. This Journal has its own Editorial Board which selects papers based on a rigorous two stage refereeing process. ToPNoC contains:

Coloured Petri Nets (CPN) is a graphical language for modelling and validating concurrent and distributed systems, and other systems in which concurrency plays a major role. The development of such systems is particularly challenging because of inherent intricacies like possible nondeterminism and the immense number of possible execution sequences.

Petri nets do not designate a single modeling formalism. In fact, newcomers to the field confess sometimes to be a little puzzled by the diversity of formalisms that are recognized under this "umbrella". Disregarding some extensions to the theoretical modeling capabilities, and looking at the level of abstraction of the formalisms, Condition/Event, Elementary, Place/Transition, Predicate/Transition, Colored, Object Oriented… net systems are frequently encountered in the literature. On the other side, provided with appropriate interpretative extensions, Controled Net Systems, Marking Diagrams (the Petri net generalization of State Diagrams), or the many-many variants in which time can be explicitly incorporated -Time(d), Deterministic, (Generalized) Stochastic, Fuzzy…- are defined. This represents another way to define practical formalisms that can be obtained by the "cro- product" of the two mentioned dimensions. Thus Petri nets constitute a modeling paradigm, understandable in a broad sense as "the total pattern of perceiving, conceptualising, acting, validating and valuing associated with a particular image of reality that prevails in a science or a branch of science" (Thomas S. Kuhn).