Muutke küpsiste eelistusi

E-raamat: Process Algebras for Petri Nets: The Alphabetization of Distributed Systems

Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 86,44 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Process Algebras for Petri Nets: The Alphabetization of Distributed SystemsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.

Arvustused

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)

1 Introduction
1(14)
1.1 The Alphabetization of Distributed Systems
1(5)
1.2 The Hierarchy
6(2)
1.3 Structure of the Book
8(3)
1.4 Interleaving vs True Concurrency
11(1)
1.5 Beyond Turing-Completeness
12(3)
2 Labeled Transition Systems
15(20)
2.1 Labeled Transition Systems
15(4)
2.2 Behavioral Equivalences
19(12)
2.2.1 Strong Equivalences
19(7)
2.2.2 Weak Equivalences
26(5)
2.3 Step Transition Systems
31(4)
3 Petri Nets
35(42)
3.1 Introduction
35(1)
3.2 Place/Transition Petri Nets
36(11)
3.2.1 Some Classes of Petri Nets
41(3)
3.2.2 Dynamically Reachable and Statically Reachable Subnets
44(3)
3.3 Decidable Properties
47(10)
3.3.1 Coverability Tree
48(6)
3.3.2 Reachability, Liveness and Deadlock
54(3)
3.4 Behavioral Equivalences
57(10)
3.4.1 Net Isomorphism
57(1)
3.4.2 Interleaving Semantics
58(6)
3.4.3 Step Semantics
64(3)
3.5 Nonpermissive Petri Nets
67(10)
3.5.1 Behavioral Equivalences
70(4)
3.5.2 Turing-Completeness
74(3)
4 The Basic Calculus: SFM
77(18)
4.1 Syntax
77(3)
4.2 Operational LTS Semantics
80(4)
4.2.1 Expressiveness
81(2)
4.2.2 Congruence
83(1)
4.3 Operational Net Semantics
84(3)
4.4 Representing All Sequential Finite-State Machines
87(3)
4.5 Denotational Net Semantics
90(5)
5 Adding Asynchronous Parallel Composition: CFM and BPP
95(26)
5.1 CFM
95(15)
5.1.1 Interleaving LTS Semantics
96(3)
5.1.2 Step Semantics
99(3)
5.1.3 Operational Net Semantics
102(4)
5.1.4 Representing All Concurrent Finite-State Machines
106(1)
5.1.5 Soundness
107(1)
5.1.6 Denotational Net Semantics
108(2)
5.2 BPP: Basic Parallel Processes
110(11)
5.2.1 Expressiveness
111(2)
5.2.2 Operational Net Semantics
113(3)
5.2.3 Representing All BPP Nets
116(2)
5.2.4 Denotational Net Semantics
118(3)
6 Adding Communication and Restriction: FNC
121(48)
6.1 Syntax
121(8)
6.1.1 Restricted Actions and Extended Processes
123(1)
6.1.2 Syntactic Substitution
124(2)
6.1.3 Sequential Subterms
126(3)
6.2 Operational LTS Semantics
129(3)
6.2.1 Expressiveness
130(2)
6.3 Step Semantics
132(2)
6.4 Operational Net Semantics
134(13)
6.4.1 Places and Markings
134(4)
6.4.2 Net Transitions
138(7)
6.4.3 The Reachable Subnet Net(p)
145(2)
6.5 Representing All Finite CCS Nets
147(5)
6.6 Soundness
152(2)
6.7 Denotational Net Semantics
154(12)
6.8 RCS
166(3)
7 Adding Multi-party Communication: FNM
169(58)
7.1 Preliminaries
169(6)
7.1.1 Syntax and Informal Semantics
169(2)
7.1.2 Extended Processes and Sequential Subterms
171(2)
7.1.3 Well-Formed Processes
173(2)
7.2 Operational LTS Semantics
175(9)
7.2.1 Expressiveness
181(2)
7.2.2 Congruence Problem
183(1)
7.3 Step Semantics
184(8)
7.3.1 Step Bisimilarity Implies Interleaving Bisimilarity
187(4)
7.3.2 Step Bisimilarity Is a Congruence
191(1)
7.4 Operational Net Semantics
192(13)
7.4.1 Places and Markings
192(3)
7.4.2 Net Transitions
195(1)
7.4.3 Properties of Net Transitions
196(6)
7.4.4 The Reachable Subnet Net(p)
202(3)
7.5 Representing All Finite P/T Nets
205(8)
7.5.1 Expressiveness
211(2)
7.6 Soundness
213(2)
7.7 Denotational Net Semantics
215(8)
7.8 RMCS
223(4)
8 Adding Atomic Tests for Absence: NPL
227(46)
8.1 Syntax
227(3)
8.2 Operational LTS Semantics
230(9)
8.2.1 Expressiveness
233(4)
8.2.2 Congruence Problem
237(2)
8.3 Step Semantics
239(7)
8.4 Operational Net Semantics
246(10)
8.4.1 Places and Markings
247(1)
8.4.2 Net Transitions
248(2)
8.4.3 Properties of Net Transitions
250(4)
8.4.4 The Reachable Subnet Net(p)
254(2)
8.5 Representing All Finite NP/T Nets
256(4)
8.6 Soundness
260(5)
8.7 Denotational Net Semantics
265(6)
8.8 RNPL
271(2)
9 Generalizations and Variant Semantics
273(14)
9.1 Communicating Petri Nets
273(1)
9.2 Variant Net Semantics
273(4)
9.3 General Restriction
277(5)
9.4 Asynchronous Communication
282(1)
9.5 Other Languages?
283(1)
9.6 Future Research
284(3)
Glossary 287(4)
References 291(8)
Index 299
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.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97833195555912e.html
Märksõnad: