High-level Petri Nets

Theory and Application

  • Kurt Jensen
  • Grzegorz Rozenberg

Table of contents

  1. Front Matter
    Pages I-IX
  2. Predicate / Transition Nets and Coloured Petri Nets

    1. Front Matter
      Pages 1-2
    2. H. J. Genrich
      Pages 3-43
  3. High-level Nets and Abstract Data Types

    1. Front Matter
      Pages 121-122
    2. J. Billington
      Pages 123-136
    3. W. Reisig
      Pages 137-170
    4. B. Krämer, H. W. Schmidt
      Pages 171-188
    5. E. Battiston, F. De Cindio, G. Mauri
      Pages 189-212
  4. Hierarchical High-level Nets

    1. Front Matter
      Pages 213-214
    2. P. Huber, K. Jensen, R. M. Shapiro
      Pages 215-243
  5. Analysis by Means of Invariants

    1. Front Matter
      Pages 245-246
    2. G. Memmi, J. Vautherin
      Pages 247-283
    3. J. M. Couvreur, J. Martínez
      Pages 284-302
  6. Analysis by Means of Reachability Graphs

    1. Front Matter
      Pages 317-317
    2. P. Huber, A. M. Jensen, L. O. Jepsen, K. Jensen
      Pages 319-350
    3. G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad
      Pages 373-396
  7. Analysis by Means of Transformations

    1. Front Matter
      Pages 397-397
    2. S. Haddad
      Pages 399-425
    3. H. J. Genrich
      Pages 426-455
  8. Analysis of Stochastic Nets

    1. Front Matter
      Pages 457-457
    2. C. Lin, D. C. Marinescu
      Pages 459-469
    3. C. Dutheillet, S. Haddad
      Pages 470-493
    4. G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad
      Pages 504-530
  9. Application of High-level Nets

  10. Computer Tools for High-level Nets

    1. Front Matter
      Pages 689-690
    2. F. Feldbrugge, K. Jensen
      Pages 691-717
  11. Back Matter
    Pages 719-725

About this book


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. The step from low-level nets to high-level nets can be compared to the step from assembly languages to modem programming languages with an elaborated type concept. In low-level nets there is only one kind of token and this means that the state of a place is described by an integer (and in many cases even by a boolean value). In high-level nets each token can carry complex information which, e. g. , may describe the entire state of a process or a data base. Today most practical applications of Petri nets use one of the different kinds of high-level nets. 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. As a result, much of this knowledge is not readily available to people who may be interested in using high-level nets.


Datentyp (EDV) EDV algorithm algorithms design development language modeling petri net programming programming language software structured analysis validation verification

Editors and affiliations

  • Kurt Jensen
    • 1
  • Grzegorz Rozenberg
    • 2
  1. 1.Computer Science DepartmentAarhus UniversityAarhus CDenmark
  2. 2.Institute of Applied Mathematics and Computer ScienceUniversity of LeidenLeidenThe Netherlands

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1991
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-54125-7
  • Online ISBN 978-3-642-84524-6
  • Buy this book on publisher's site