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

Abstract 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 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.
AbstractList 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 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.
Author Gorrieri, Roberto
Author_xml – sequence: 1
  fullname: Gorrieri, Roberto
BackLink https://cir.nii.ac.jp/crid/1130000796709616000$$DView record in CiNii
BookMark eNpNkM1OAyEURlGrsWofwJUTY2JcoFxgGFjWpv4kjbowbgmDTDt2HCqM-vrSjjGyAG44383lHKBB61uH0DGQSyCkuFKFxAwzUDhPS2HYQgcslZtKbKMhBcUwJULt_H8YoCFwBpiKnO-hoZKUy4IotY9GMb4RQkCCojIfopOn4K2LMRs3c1cGE7PKh-zJdaHOHlwXj9BuZZroRr_nIXq5mT5P7vDs8fZ-Mp5hQwWXDBsibJpCSleVXPFCgrU8d5KWopKWVIoKm7NCVKp8ZUS5ypTSlhUrZZEDdTk7RBd9YxOX7jsufNNF_dW40vtl1MnD3-8gsVc9G1ehbucu6J4CotfW1rRmOvF6E9DrxHmfWAX_8elipzeNrWu7YBo9vZ5wyUFQlsiznmzrWtt6vQOwpIwUSiSHAkS6J-y0x6yJpkmYfvetnwezWkSdJwNpXPYDLh16YA
ContentType eBook
Book
Copyright Springer International Publishing AG 2017
Copyright_xml – notice: Springer International Publishing AG 2017
DBID I4C
RYH
DEWEY 004
DOI 10.1007/978-3-319-55559-1
DatabaseName Casalini Torrossa eBooks Institutional Catalogue
CiNii Complete
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 3319555596
9783319555591
EISSN 2193-2069
Edition 1
ExternalDocumentID 9783319555591
418893
EBC4841623
BB23836773
5494331
GroupedDBID 0D6
0DA
20A
38.
AABBV
AALVI
ABHTH
ABQUB
ACBPT
ACDJR
ADCXD
AEJLV
AEKFX
AETDV
AEZAY
AGIGN
AGYGE
AIODD
ALBAV
ALMA_UNASSIGNED_HOLDINGS
AZZ
BATQV
BBABE
CRSEL
CZZ
I4C
IEZ
SBO
SWYDZ
TPJZQ
Z7R
Z7U
Z7X
Z7Z
Z81
Z83
Z84
Z85
Z88
RYH
SAO
Z5O
Z7W
Z7Y
Z87
ID FETCH-LOGICAL-a26483-a06c06988efb494781cc45e82b6f8c0f926c5376f9bd309efab8cbf3b87512e53
ISBN 3319555596
9783319555591
9783319555584
3319555588
ISSN 1431-2654
IngestDate Fri Nov 08 05:47:14 EST 2024
Fri May 23 03:00:31 EDT 2025
Sat May 31 00:07:46 EDT 2025
Thu Jun 26 23:18:54 EDT 2025
Sun May 11 05:58:57 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCallNum_Ident Q
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-a26483-a06c06988efb494781cc45e82b6f8c0f926c5376f9bd309efab8cbf3b87512e53
Notes Includes bibliographical references (p. 291-297) and index
OCLC 982487099
PQID EBC4841623
PageCount 307
ParticipantIDs askewsholts_vlebooks_9783319555591
springer_books_10_1007_978_3_319_55559_1
proquest_ebookcentral_EBC4841623
nii_cinii_1130000796709616000
casalini_monographs_5494331
PublicationCentury 2000
PublicationDate 2017
c2017
20170414
2017-04-13
PublicationDateYYYYMMDD 2017-01-01
2017-04-14
2017-04-13
PublicationDate_xml – year: 2017
  text: 2017
PublicationDecade 2010
PublicationPlace Cham
PublicationPlace_xml – name: Netherlands
– name: Cham
PublicationSeriesTitle Monographs in Theoretical Computer Science. An EATCS Series
PublicationSeriesTitleAlternate Monographs Theoret.Computer Science(formerly:EATCS)
PublicationYear 2017
Publisher Springer Nature
Springer
Springer International Publishing AG
Springer International Publishing
Publisher_xml – name: Springer Nature
– name: Springer
– name: Springer International Publishing AG
– name: Springer International Publishing
RelatedPersons Rozenberg, Grzegorz
Henzinger, Monika
Salomaa, Arto
Nielsen, Mogens
Hromkovič, Juraj
RelatedPersons_xml – sequence: 1
  givenname: Monika
  surname: Henzinger
  fullname: Henzinger, Monika
  organization: Faculty of Science, Universität Wien, Wien, Austria
– sequence: 2
  givenname: Juraj
  surname: Hromkovič
  fullname: Hromkovič, Juraj
  organization: Department of Computer Science, Swiss Federal Institute of Technology, Zürich, Switzerland
– sequence: 3
  givenname: Mogens
  surname: Nielsen
  fullname: Nielsen, Mogens
  organization: Department of Computer Science, Aarhus Universitet, Aarhus, Denmark
– sequence: 4
  givenname: Grzegorz
  surname: Rozenberg
  fullname: Rozenberg, Grzegorz
  organization: Leiden Centre of Adv. Computer Science, Leiden University, Leiden, The Netherlands
– sequence: 5
  givenname: Arto
  surname: Salomaa
  fullname: Salomaa, Arto
  organization: Turku Centre of Computer Science, Turku, Finland
SSID ssj0001819285
ssib002801809
Score 2.1285868
Snippet 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...
SourceID askewsholts
springer
proquest
nii
casalini
SourceType Aggregation Database
Publisher
SubjectTerms 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
Subtitle The Alphabetization of Distributed Systems
TableOfContents 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
Title Process Algebras for Petri Nets
URI http://digital.casalini.it/9783319555591
https://cir.nii.ac.jp/crid/1130000796709616000
https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=4841623
http://link.springer.com/10.1007/978-3-319-55559-1
https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783319555591&uid=none
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Na9wwEB2a7aW5NP2ibpIiSg-FxWW9km2pt27YEELaUxpyE5JWgqXFG2q3h_76ztjW2rsESnMRtjGS0NPHSJr3BuB9aYNxwvhU4eBJccULqVrhuPKiXAUrJVqpRE7-8rW4-CYub_PbITpeyy5p7Ef3515eyUNQxW-IK7Fk_wPZbab4AZ8RX0wRYUz3jN_tawdu794_pSAduN1tNRWmdxQca1r5pp5Gb42WSWt905MtyTJckVIuBblCS7MeyZV3GvkUv249eFxvxocCWbl3KBAPBXc2ixxHW07yXuLeqXPsLUHMJvpVpdmwTmy99xYLXOd5UZb8AA7KUk7g8efl5dXNcLZFKmsyJypNLFN2YkdDHeINcy_yu1PmIRya-jtO8rgANDVZDKY2RBRFA6Bar3c2A3v3161ZcH0EE6KKPINHvnoOT2OADNbPly_gqseJRZwY4sRanBjhxD4xRIntocQ2gY1QYj1KL-HmfHl9dpH24StSQ26DPDXYz2eFktIHKxRxep0TuZdzWwTpZkHNC0dqOkHZFZ8pH4yVzgZucQ-ZzX3OX8Gk2lT-NTDHHQ-Z9QU3RmA2ppA2L6wnqU8hnEng3ajF9O8f7VV7rUdNrrIEjmNDahwJnSR6rXOsG_6UwCm2rXZrSjO65URsFMn7FRlaxbMEWGx13ebeew_r5eJM0OX1nCfwIaKhu_KjKDbWQ3ONNdFtVXT25h-lHcOToV-fwKT5-cufovnX2Ld9b_sLAihQcw
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Process+algebras+for+petri+nets+%3A+the+alphabetization+of+distributed+systems&rft.au=Gorrieri%2C+Roberto&rft.date=2017-01-01&rft.pub=Springer&rft.isbn=9783319555584&rft_id=info:doi/10.1007%2F978-3-319-55559-1&rft.externalDocID=BB23836773
thumbnail_m http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97833195%2F9783319555591.jpg
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fmedia.springernature.com%2Fw306%2Fspringer-static%2Fcover-hires%2Fbook%2F978-3-319-55559-1