Process Algebras for Petri Nets

This book 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 also suggests the need for a generalization of Turing computability theory.

It is important for graduate students and researchers engaged with the concurrent semantics of distributed communicating systems. The author assumes some prior knowledge of formal languages and theoretical computer science.

Relates hierarchies of classes of Petri nets and process algebras First book to discuss limitations of Turing computability Important for graduate students and researchers engaged with the concurrent semantics of distributed communication systems

Autorentext
Roberto Gorrieri is a professor in the Università di Bologna. His research and teaching interests include theoretical computer science, particularly concurrency, the foundations of software engineering, and the foundations of security. He coauthored the textbook "Introduction to Concurrency Theory: Transition Systems and CCS" in 2015, and he has authored over 140 formal academic publications. He received his PhD in Computer Science from the Università di Pisa.

Inhalt

Introduction.- Transition Systems.- Petri Nets.- The Basic Calculus: SFM.- Adding Asynchronous Parallel Composition: CFM and BPP.- Adding Communication and Restriction: FNC.- Adding Multi-party Communication: FNM.- Adding Atomic Tests for Absence: NPL.- Generalizations and Conclusions.