Advertisement

Table of contents

  1. Front Matter
    Pages I-XI
  2. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 1-5
  3. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 7-28
  4. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 29-71
  5. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 73-132
  6. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 133-172
  7. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 173-226
  8. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 227-294
  9. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 295-312
  10. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 313-348
  11. Eike Best, Raymond Devillers, Maciej Koutny
    Pages 349-350
  12. Back Matter
    Pages 351-380

About this book

Introduction

This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from Process Algebra and Petri Nets, two prominent branches of concurrency theory. Added synergistic benefit is derived from combining their respective advantages.
Petri nets are treated as composable objects, and as such they are embedded in a general process algebra. On the other hand, a generic process algebra is given an automatic Petri net semantics so that net-based verification techniques, based on structural invariants and causal partial orders, can be applied to the process algebra. Finally, the theory is applied to a realistic concurrent programming language.
The book contains full proofs, carefully chosen examples and several possible directions for further research. It is self-contained and supposes only acquaintance with basic discrete mathematics. A unique aspect is that the development of the Petri net algebra is handled so as to allow for further application-oriented extensions and modifications.

Keywords

Concurrency Infinite Operators Petri Nets Process algebras Programming Language Semantics Recursion Refinement SOS Semantics Structural Invariants petri net programming programming language proof semantics verification

Authors and affiliations

  • Eike Best
    • 1
  • Raymond Devillers
    • 2
  • Maciej Koutny
    • 3
  1. 1.Fachbereich InformatikCarl von Ossietzky Universität OldenburgOldenburgGermany
  2. 2.Faculté des Sciences, Laboratoire d’Informatique ThéoriqueUniversité Libre de BruxellesBruxellesBelgium
  3. 3.Department of Computing ScienceUniversity of NewcastleNewcastle upon TyneUK

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-04457-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-08677-9
  • Online ISBN 978-3-662-04457-5
  • Series Print ISSN 1431-2654
  • Buy this book on publisher's site