Treffer: Process Algebras for Petri Nets: The Alphabetization of Distributed Systems

Title:
Process Algebras for Petri Nets: The Alphabetization of Distributed Systems
Publication Year:
2017
Physical Description:
XIII, 302 p. 64 illus., 4 illus. in color. online resource.
Series:
Monographs in Theoretical Computer Science. An EATCS Series
Monographs in Theoretical Computer Science. An EATCS Series
Contents Note:
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.
Original Identifier:
(Springer)9783319555591
Document Type:
Buch Book
Language:
English
ISBN:
978-3-319-55559-1
3-319-55559-6
Rights:
This record is part of the Harvard Library Bibliographic Dataset, which is provided by the Harvard Library under its Bibliographic Dataset Use Terms and includes data made available by, among others, OCLC Online Computer Library Center, Inc. and the Library of Congress.
Accession Number:
edshlc.015019467.6
Database:
Harvard Library Bibliographic Dataset

Weitere Informationen

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.