Muutke küpsiste eelistusi

E-raamat: Models for Concurrency

  • Formaat: 248 pages
  • Ilmumisaeg: 26-Aug-2020
  • Kirjastus: Taylor & Francis Ltd
  • Keel: eng
  • ISBN-13: 9781000124743
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 64,99 €*
  • * 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.
  • Raamatukogudele
  • Formaat: 248 pages
  • Ilmumisaeg: 26-Aug-2020
  • Kirjastus: Taylor & Francis Ltd
  • Keel: eng
  • ISBN-13: 9781000124743
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. 

Concurrent systems are generally understood in terms of behavioral notions. Models for Concurrency analyzes the subject in terms of events and their temporal relationship rather than on global states. It presents a comprehensive analysis of model theory applied to concurrent protocols, and seeks to provide a theory of concurrency that is both intuitively appealing and rigorously based on mathematical foundations.
The book is divided into three main sections. The first introduces the required concepts from model theory, details the structures that are used to model concurrency, gives an in-depth description and explanation of the semantics of a simple language that allows concurrent execution of sequential programs, and deals with the question of resolving executions into higher-level and lower-level granularities. The second and third sections apply the theory developed to practical examples, and an exposition of the producer/consumer problem with details of two solutions is given. The author also deals with message passing, as opposed to shared memory.
Preface ix
PART 1 Semantics of distributed protocols
Elements of model theory
3(21)
Structures
3(5)
Examples of multi-sorted structures
5(3)
First-order languages and satisfaction
8(7)
Satisfaction
10(2)
Logical implication
12(1)
Substructures and reducts
12(1)
Composite structures
13(2)
An example: a mutual exclusion protocol
15(9)
Proof of the Mutual Exclusion property
21(3)
System executions
24(24)
Time and interval orderings
24(6)
Finiteness conditions
27(3)
Definition of system executions
30(2)
Global time
30(1)
Parallel composition of systems
31(1)
Higher and lower-level events
32(2)
Beginning of events
34(1)
Specification of registers and communication devices
34(7)
Specifying communication devices
37(4)
Achilles and the Tortoise
41(7)
Concurrency
44(2)
Zeno's paradox
46(2)
Semantics of concurrent protocols
48(21)
A protocol language and its flowcharts
49(8)
Serial and concurrent procedures
50(2)
Flowcharts of protocols
52(3)
States and transitions
55(2)
Semantics of flowcharts
57(2)
Histories and executions of flowcharts
57(2)
External semantics
59(1)
Histories as structures
59(2)
The Pitcher/Catcher example
61(8)
Correctness of protocols
69(9)
Mutual exclusion revisited
69(9)
Higher-level events
78(33)
Pitcher/Catcher revisited
79(11)
Procedure calls
90(1)
KanGaroo and LoGaroo
91(8)
Formalizing the proof
95(4)
The Aimless Protocols
99(7)
Higher-level relations
101(5)
Local registers
106(5)
PART 2 Shared-variable communication
On the Producer/Consumer problem: buffers and semaphores
111(21)
The Producer/Consumer problem
111(3)
Buffer cells
114(1)
Semaphores
115(11)
The textbook specification
117(5)
Abstract specification of semaphores
122(4)
Load/unload with semaphores
126(3)
A Multiple Process Mutual Exclusion Protocol
129(3)
Circular buffers
132(15)
Unbounded sequence numbers
132(10)
The function activate
136(4)
Safety
140(1)
Liveness
141(1)
Bounded sequence numbers
142(5)
PART 3 Message communication
Specification of channels
147(17)
Channels
148(4)
Capacity of a channel
151(1)
A redressing protocol
152(2)
Sliding Window Axioms
154(4)
A Multiple Producer Protocol
158(6)
A Sliding window protocol
164(25)
Protocol analysis and definition and higher-level events
170(14)
Higher-level functions
177(7)
The Sliding Window Axioms hold
184(3)
Complete Send/Receive/Ack events
184(3)
Correctness of the protocol
187(2)
Broadcasting and causal ordering
189(14)
Send/Receive Network Signature
190(1)
Message Domain
191(2)
Causality
193(3)
Causality preservation and deliveries
196(3)
Uniform deliveries
198(1)
Time-stamp vectors
199(4)
Uniform delivery in group communication
203(29)
A generic Uniform Delivery Protocol
203(10)
The Time-Stamp Vector Axioms are satisfied
207(2)
Data Buffers
209(3)
The All-Ack Protocol
212(1)
Correctness of the generic protocol
213(2)
The Early Delivery Protocol
215(6)
A worked-out example
221(11)
Epilogue: Formal and informal correctness proofs 232(2)
References 234(2)
Index 236
Uri Abraham