Process Algebras for Petri Nets The Alphabetization of Distributed Systems

This text deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely accepted model for distributed systems. Hence, the contribution of this book amounts to the alphabetization of some classes of distributed systems. The book a...

Full description

Saved in:
Bibliographic Details
Main Author Gorrieri, Roberto
Format eBook Book
LanguageEnglish
Published Cham Springer Nature 2017
Springer
Springer International Publishing AG
Springer International Publishing
Edition1
SeriesMonographs in Theoretical Computer Science. An EATCS Series
Subjects
Computer Science
Data processing Computer science
Electronic data processing
Electronic data processing > Distributed processing > Mathematical models
Mathematical Logic and Foundations
Petri nets
Software engineering
Software Engineering/Programming and Operating Systems
Theory of Computation
Online AccessGet full text
ISBN3319555596
9783319555591
9783319555584
3319555588
ISSN1431-2654
2193-2069
DOI10.1007/978-3-319-55559-1

Cover

Table of Contents:
  • 6.3 Step Semantics -- 6.4 Operational Net Semantics -- 6.4.1 Places and Markings -- 6.4.2 Net Transitions -- 6.4.3 The Reachable Subnet Net(p) -- 6.5 Representing All Finite CCS Nets -- 6.6 Soundness -- 6.7 Denotational Net Semantics -- 6.8 RCS -- Chapter 7: Adding Multi-party Communication: FNM -- 7.1 Preliminaries -- 7.1.1 Syntax and Informal Semantics -- 7.1.2 Extended Processes and Sequential Subterms -- 7.1.3 Well-Formed Processes -- 7.2 Operational LTS Semantics -- 7.2.1 Expressiveness -- 7.2.2 Congruence Problem -- 7.3 Step Semantics -- 7.3.1 Step Bisimilarity Implies Interleaving Bisimilarity -- 7.3.2 Step Bisimilarity Is a Congruence -- 7.4 Operational Net Semantics -- 7.4.1 Places and Markings -- 7.4.2 Net Transitions -- 7.4.3 Properties of Net Transitions -- 7.4.4 The Reachable Subnet Net(p) -- 7.5 Representing All Finite P/T Nets -- 7.5.1 Expressiveness -- 7.6 Soundness -- 7.7 Denotational Net Semantics -- 7.8 RMCS -- Chapter 8: Adding Atomic Tests for Absence: NPL -- 8.1 Syntax -- 8.2 Operational LTS Semantics -- 8.2.1 Expressiveness -- 8.2.2 Congruence Problem -- 8.3 Step Semantics -- 8.4 Operational Net Semantics -- 8.4.1 Places and Markings -- 8.4.2 Net Transitions -- 8.4.3 Properties of Net Transitions -- 8.4.4 The Reachable Subnet Net(p) -- 8.5 Representing All Finite NP/T Nets -- 8.6 Soundness -- 8.7 Denotational Net Semantics -- 8.8 RNPL -- Chapter 9: Generalizations and Variant Semantics -- 9.1 Communicating Petri Nets -- 9.2 Variant Net Semantics -- 9.3 General Restriction -- 9.4 Asynchronous Communication -- 9.5 Other Languages? -- 9.6 Future Research -- Glossary -- References -- Index
  • Intro -- Foreword -- Acknowledgements -- Contents -- Chapter 1: Introduction -- 1.1 The Alphabetization of Distributed Systems -- 1.2 The Hierarchy -- 1.3 Structure of the Book -- 1.4 Interleaving vs True Concurrency -- 1.5 Beyond Turing-Completeness -- Chapter 2: Labeled Transition Systems -- 2.1 Labeled Transition Systems -- 2.2 Behavioral Equivalences -- 2.2.1 Strong Equivalences -- 2.2.2 Weak Equivalences -- 2.3 Step Transition Systems -- Chapter 3: Petri Nets -- 3.1 Introduction -- 3.2 Place/Transition Petri Nets -- 3.2.1 Some Classes of Petri Nets -- 3.2.2 Dynamically Reachable and Statically Reachable Subnets -- 3.3 Decidable Properties -- 3.3.1 Coverability Tree -- 3.3.2 Reachability, Liveness and Deadlock -- 3.4 Behavioral Equivalences -- 3.4.1 Net Isomorphism -- 3.4.2 Interleaving Semantics -- 3.4.3 Step Semantics -- 3.5 Nonpermissive Petri Nets -- 3.5.1 Behavioral Equivalences -- 3.5.2 Turing-Completeness -- Chapter 4: The Basic Calculus: SFM -- 4.1 Syntax -- 4.2 Operational LTS Semantics -- 4.2.1 Expressiveness -- 4.2.2 Congruence -- 4.3 Operational Net Semantics -- 4.4 Representing All Sequential Finite-State Machines -- 4.5 Denotational Net Semantics -- Chapter 5: Adding Asynchronous Parallel Composition: CFM and BPP -- 5.1 CFM -- 5.1.1 Interleaving LTS Semantics -- 5.1.2 Step Semantics -- 5.1.3 Operational Net Semantics -- 5.1.4 Representing All Concurrent Finite-State Machines -- 5.1.5 Soundness -- 5.1.6 Denotational Net Semantics -- 5.2 BPP: Basic Parallel Processes -- 5.2.1 Expressiveness -- 5.2.2 Operational Net Semantics -- 5.2.3 Representing All BPP Nets -- 5.2.4 Denotational Net Semantics -- Chapter 6: Adding Communication and Restriction: FNC -- 6.1 Syntax -- 6.1.1 Restricted Actions and Extended Processes -- 6.1.2 Syntactic Substitution -- 6.1.3 Sequential Subterms -- 6.2 Operational LTS Semantics -- 6.2.1 Expressiveness