Skip to main content
SpringerLink
Log in

High-level Petri Nets

Theory and Application

  • Book
  • © 1991

Overview

Editors:
  1. Kurt Jensen

    1. Computer Science Department, Aarhus University, Aarhus C, Denmark

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Grzegorz Rozenberg

    1. Institute of Applied Mathematics and Computer Science, University of Leiden, Leiden, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (28 chapters)

  1. Front Matter

    Pages I-IX
    Download chapter PDF

  2. Predicate / Transition Nets and Coloured Petri Nets

    1. Front Matter

      Pages 1-2
      Download chapter PDF

    2. Predicate / Transition Nets

      • H. J. Genrich
      Pages 3-43

    3. Coloured Petri Nets: A High Level Language for System Design and Analysis

      • K. Jensen
      Pages 44-119

  3. High-level Nets and Abstract Data Types

    1. Front Matter

      Pages 121-122
      Download chapter PDF

    2. Many-sorted High-level Nets

      • J. Billington
      Pages 123-136

    3. Petri Nets and Algebraic Specifications

      • W. Reisig
      Pages 137-170

    4. Types and Modules for Net Specifications

      • B. Krämer, H. W. Schmidt
      Pages 171-188

    5. OBJSA Nets: A Class of High-level Nets Having Objects as Domains

      • E. Battiston, F. De Cindio, G. Mauri
      Pages 189-212

  4. Hierarchical High-level Nets

    1. Front Matter

      Pages 213-214
      Download chapter PDF

    2. Hierarchies in Coloured Petri Nets

      • P. Huber, K. Jensen, R. M. Shapiro
      Pages 215-243

  5. Analysis by Means of Invariants

    1. Front Matter

      Pages 245-246
      Download chapter PDF

    2. Analysing Nets by the Invariant Method

      • G. Memmi, J. Vautherin
      Pages 247-283

    3. Linear Invariants in Commutative High Level Nets

      • J. M. Couvreur, J. Martínez
      Pages 284-302

    4. Generalized Inverses and the Calculation of Symbolic Invariants for Coloured Petri Nets

      • M. Silva, J. Martinez, P. Ladet, H. Alla
      Pages 303-315

  6. Analysis by Means of Reachability Graphs

    1. Front Matter

      Pages 317-317
      Download chapter PDF

    2. Reachability Trees for High-level Petri Nets

      • P. Huber, A. M. Jensen, L. O. Jepsen, K. Jensen
      Pages 319-350

    3. Parametrized Reachability Trees for Predicate / Transition Nets

      • M. Lindqvist
      Pages 351-372

    4. On Well-Formed Coloured Nets and Their Symbolic Reachability Graph

      • G. Chiola, C. Dutheillet, G. Franceschinis, S. Haddad
      Pages 373-396

  7. Analysis by Means of Transformations

    1. Front Matter

      Pages 397-397
      Download chapter PDF
Back to top

Keywords

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.

Editors and Affiliations

  • Computer Science Department, Aarhus University, Aarhus C, Denmark

    Kurt Jensen

  • Institute of Applied Mathematics and Computer Science, University of Leiden, Leiden, The Netherlands

    Grzegorz Rozenberg

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation