Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Syntax and Semantics of Petri Nets
    Show more authors
    • You may already have access via personal or institutional login
  • Select format
  • Publisher:
    Cambridge University Press
    Publication date:
    September 2025
    September 2025
    ISBN:
    9781009613316
    9781009613286
    DOI:
    https://doi.org/10.1017/9781009613316
    Dimensions:
    (244 x 170 mm)
    Weight & Pages:
    0.55kg, 282 Pages
    Dimensions:
    Weight & Pages:
    • Subjects:
    Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Distributed, Networked and Mobile Computing, Programming Languages and Applied Logic
    Series:
    Cambridge Tracts in Theoretical Computer Science (63)
You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Distributed, Networked and Mobile Computing, Programming Languages and Applied Logic
    Series:
    Cambridge Tracts in Theoretical Computer Science (63)
    Information

    Book description

    Petri nets are one of the most popular tools for modeling distributed systems. This book provides a modern look at the theory behind them, by studying three classes of nets that model (i) sequential systems, (ii) non-communicating parallel systems, and (iii) communicating parallel systems. A decidable and causality respecting behavioral equivalence is presented for each class, followed by a modal logic characterization for each equivalence. The author then introduces a suitable process algebra for the corresponding class of nets and proves that the behavioral equivalence proposed for each class is a congruence for the operator of the corresponding process algebra. Finally, an axiomatization of the behavioral congruence is proposed. The theory is introduced step by step, with ordinary-language explanations and examples provided throughout, to remain accessible to readers without specialized training in concurrency theory or formal logic. Exercises with solutions solidify understanding, and the final chapter hints at extensions of the theory.

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents
    References

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.