Skip to main content
SpringerLink
Log in
Book cover

Petri Net Algebra

  • Book
  • © 2001

Overview

Authors:
  1. Eike Best

    1. Fachbereich Informatik, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Raymond Devillers

    1. Faculté des Sciences, Laboratoire d’Informatique Théorique, Université Libre de Bruxelles, Bruxelles, Belgium

    View author publications

    You can also search for this author in PubMed   Google Scholar

  3. Maciej Koutny

    1. Department of Computing Science, University of Newcastle, Newcastle upon Tyne, UK

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • A study of the relationship between Petri nets and process algebras
  • A detailed development of a formal model combining these two approaches
  • Self-contained and with full proofs and carefully chosen examples
  • Includes supplementary material: sn.pub/extras

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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 (10 chapters)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Introduction

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 1-5

  3. The Petri Box Calculus

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 7-28

  4. Syntax and Operational Semantics

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 29-71

  5. Petri Net Semantics

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 73-132

  6. Adding Recursion

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 133-172

  7. S-invariants

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 173-226

  8. The Box Algebra

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 227-294

  9. PBC and Other Process Algebras

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 295-312

  10. A Concurrent Programming Language

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 313-348

  11. Conclusion

    • Eike Best, Raymond Devillers, Maciej Koutny
    Pages 349-350

  12. Back Matter

    Pages 351-380
    Download chapter PDF
Back to top

Keywords

About this book

In modern society services and support provided by computer-based systems have become ubiquitous and indeed have started to fund amentally alter the way people conduct their business. Moreover, it has become apparent that among the great variety of computer technologies available to potential users a crucial role will be played by concurrent systems. The reason is that many commonly occurring phenomena and computer applications are highly con­ current : typical examples include control systems, computer networks, digital hardware, business computing, and multimedia systems. Such systems are characterised by ever increasing complexity, which results when large num­ bers of concurrently active components interact. This has been recognised and addressed within the computing science community. In particular, sev­ eral form al models of concurrent systems have been proposed, studied, and applied in practice. This book brings together two of the most widely used formalisms for de­ scribing and analysing concurrent systems: Petri nets and process algebras. On the one hand , process algebras allow one to specify and reason about the design of complex concurrent computing systems by means of algebraic operators corresponding to common programming constructs. Petri nets, on the other hand, provide a graphical representation of such systems and an additional means of verifying their correctness efficiently, as well as a way of expressing properties related to causality and concurrency in system be­ haviour.

Reviews

From the reviews:

"The monograph presents a step-by step development of rigorous framework for the specification and verification of concurrent systems. … The book contains full proofs, carefully chosen examples and several possible directions for further research. The development of the Petri net algebra is handled in such a way that it allows for further application-oriented extensions and modifications. The book is self-contained in the sense that no previous knowledge of Petri nets and process algebras is required." (Ryszard Janicki, Mathematical Reviews, Issue 2003 g)

"This monograph combines two theories of concurrency: process algebras and Petri nets. … The book can serve researches and practitioners working in concurrency theory or in formalization of parallel and distributed systems. It can also be used in an advanced graduate course as a textbook or as a reference. The book contains numerous examples and exercises included in the text immediately following the relevant material. … it is well organized and coherent both in structure and content." (Boleslaw Mikolajczak, SIGACT News, Vol. 33 (2), 2002)

Authors and Affiliations

  • Fachbereich Informatik, Carl von Ossietzky Universität Oldenburg, Oldenburg, Germany

    Eike Best

  • Faculté des Sciences, Laboratoire d’Informatique Théorique, Université Libre de Bruxelles, Bruxelles, Belgium

    Raymond Devillers

  • Department of Computing Science, University of Newcastle, Newcastle upon Tyne, UK

    Maciej Koutny

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation