Includes bibliographical references.
|Statement||K. Jensen, G. Rozenberg (eds.).|
|Contributions||Jensen, K. 1950-, Rozenberg, Grzegorz.|
|LC Classifications||QA267 .H48 1991|
|The Physical Object|
|Pagination||ix, 724 p. :|
|Number of Pages||724|
|ISBN 10||354054125X, 038754125X|
|LC Control Number||91017121|
A considerable body of knowledge exists about high-level Petri nets this includes theoretical foundations, analysis methods and many applications. Unfortunately, the papers on high-level Petri nets have been scattered throughout various journals and collections. The book contains reprints of some of the most important papers on the application and theory of high-level Petri nets. In this way it makes the relevant literature more available. It is our hope that the book will be a useful source of information and that, e.g., it can be used in the organization of Petri net courses. High-level Petri Nets are normally represented using a graphical form which allows visualisation of system dynamics (ﬂows of data and control). This approach is taken, as it is the graphical form of HLPNs that is most appropriate for industrial use. The graphical form is referred to as a High-levelPetri Net Graph (HLPNG). nets. It is based on XML and called the Petri Net Markup Language (PNML). PNML facilitates the exchange of Petri nets among diﬀerent Petri net tools. There are many diﬀerent variants of Petri nets. High-level Petri Nets as deﬁned in ISO/IEC are one version that attempts to cover many variants of Petri nets, although not all.
class of high-level net chosen. This document is Part 1 of the ISO/IEC series. It describes definitions, semantics, execution and graphical notations for high-level Petri nets. A transfer format for the high-level Petri nets is the subject of Part 2, while Part 3 addresses techniques for enrichments, extensions and structuring mechanisms. The paper presents a high-level Petri net model of concurrent systems called predicate /transition-nets (PrT-nets). Its places represent variable properties of, or relations between, individuals; they are ‘predicates’ with variable extension. The transitions represent classes of elementary changes of those extensions. The first successful type of high-level Petri Nets was called Predicate/Transition Nets(Pr/T-nets). This net class was developed by Hartmann Genrich and Kurt Lautenbach from Petri’s group at Schloss Birlinghoven. The first paper was presented at a conference on Semantics of Concurrent Computation in The work was partly based on earlier work: Transition nets with coloured . Motivated by a short historical overview of Petri net usage at our premises, we introduce the requirements we have to pose on a formal specification language. We present three selected applications of high-level Petri nets in the area of Intelligent Networks.
"Half a century ago Carl Adam Petri's thesis appeared, and a new wonderful theory was born: Petri nets. This book digests 50 years of science and engineering, and research and applications of Petri nets; it marks a current high, pedagogically and s: 6. A Petri net is a mathematical representation of a network. This book first introduces the basic models including time and stochastic extensions, in particular place-transition and high level Petri nets. Their modeling and design capabilities are illustrated by a set of representations of interest in operating and communication systems. The key notion is a high-level occurrence net K, which generalizes the well-known notion of occurrence nets from low-level to high-level nets. In contrast to the low-level case we consider high-level occurrence nets together with a set of initial markings of the input places. High level Petri nets were developed to support data and functionality definitions. To support the practical applications of Petri nets formalism, tools for designing and executing Petri nets are.