Process Algebras for Petri Nets

The Alphabetization of Distributed Systems

AvRoberto Gorrieri

Häftad, Engelska, 2018

Del i serien Monographs in Theoretical Computer Science. An EATCS Series

875 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Inbunden

875 kr

E-bok

1 105 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2018-05-09
Mått:155 x 235 x 18 mm
Vikt:482 g
Format:Häftad
Språk:Engelska
Serie:Monographs in Theoretical Computer Science. An EATCS Series
Antal sidor:302
Förlag:Springer International Publishing AG
ISBN:9783319856940

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT
Matematikens grunder inom Naturvetenskap och teknik

Mer om författaren

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.

Recensioner i media

“Gorrieri's monograph is truly illuminating and has fully met my high expectations regarding content, originality, technical rigor, and presentation. It should be on the reading list of every doctoral student in concurrency theory and also of those research scholars who have some grounding in concurrency theory but are not experts in both Petri nets and process algebras.” (Gerald Lüttgen, Mathematical Reviews, April, 2018)

Innehållsförteckning

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.