๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Logics and models of concurrent systems

โœ Scribed by E. M. Clarke, M. C. Browne, E. A. Emerson, A. P. Sistla (auth.), Krzysztof R. Apt (eds.)


Publisher
Springer-Verlag Berlin Heidelberg
Year
1985
Tongue
English
Leaves
494
Series
NATO ASI Series 13 Series F, Computer and systems sciences
Edition
1
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


The cooperation test [Apt, Francez & de Roever] was originally conceived to capture the proof theoretical analogue of distributed message exchange between disjoint processes, as opposed to the interference freedom test [Owicki & Gries], being the proof theoretical analogue of concurrent communication by means of interference through jointly shared variables. Some authors ([Levin & Gries, Lamport & Schneider, Schlichting and Schneider]) stress that both forms of communication can be proof theoretically characterized using interference freedom only, since proofs for both ultimately amount to an invariance proof of a big global assertion [Ashcroft], invariance of whose parts amounts to interference freedom. Yet I feel that the characteristic nature of the cooperation test is still preserved in the analysis of these authors, because in their analysis of CSP the part dealing with interference freedom specializes to maintenance of a global invariant, the expression of which requires per process the introduction of auxiliary variables which are updated in that process only, thus preserving the concept of disjointness (as opposed to sharing), since now all variables from different processes are disjoint. The cooperation test has been applied to characterize concurrent communication as occurring in Hoare's Communicating Sequential Processes (CSP) [Hoare 2], Ichbiah's ADA [ARM], and Brinch Hansen's Distributed Processes (DP) [Brinch Hansen]. This characterization has been certified through soundness and completeness proofs [Apt 2, Gerth]. As in the interference freedom test this characterization consists of two stages, a local sequential stage and a global stage.

โœฆ Table of Contents


Front Matter....Pages I-VIII
Front Matter....Pages 1-1
Using Temporal Logic for Automatic Verification of Finite State Systems....Pages 3-26
Resolution Modal Logics....Pages 27-55
Tools for Verifying Network Protocols....Pages 57-76
An Axiomatic Semantics of Concurrent Programming Languages....Pages 77-122
In Transition From Global to Modular Temporal Reasoning about Programs....Pages 123-144
Front Matter....Pages 145-145
Correctness Proofs of Distributed Termination Algorithms....Pages 147-167
Script: A Communication Abstraction Mechanism and its Verification....Pages 169-212
The Cooperation Test : a syntax-directed verification method....Pages 213-257
Front Matter....Pages 259-259
Notes on Algebraic Calculi of Processes....Pages 261-303
Deadlock Analysis in Networks of Communicating Processes....Pages 305-323
A Paradigm for Detecting Quiescent Properties in Distributed Computations....Pages 325-341
About Fair Asynchrony....Pages 343-368
A Logic for the Specification and Proof of Controllable Processes of CCS....Pages 369-395
Specification-Oriented Programming in TCSP....Pages 397-435
Front Matter....Pages 437-437
Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems....Pages 439-457
Towards a Theory of Knowledge and Ignorance: Preliminary Report....Pages 459-476
On the Development of Reactive Systems....Pages 477-498
Back Matter....Pages 499-499

โœฆ Subjects


Computer Communication Networks; Programming Techniques


๐Ÿ“œ SIMILAR VOLUMES


Logics and models of concurrent systems
โœ Krzysztof R Apt; North Atlantic Treaty Organization. Scientific Affairs Division ๐Ÿ“‚ Library ๐Ÿ“… 1985 ๐Ÿ› Springer-Verlag ๐ŸŒ English

The challenges of problems from international programming competitions are an effective way to improve your algorithmic and coding skills and understanding. ย  This volume uses international programming competition-type problems to motivate the study of algorithms, programming, and other topics in

Logics and Models of Concurrent Systems
โœ E. M. Clarke, M. C. Browne, E. A. Emerson, A. P. Sistla (auth.), Krzysztof R. Ap ๐Ÿ“‚ Library ๐Ÿ“… 1985 ๐Ÿ› Springer-Verlag Berlin Heidelberg ๐ŸŒ English

<p>The cooperation test [Apt, Francez & de Roever] was originally conceived to capture the proof theoretical analogue of distributed message exchange between disjoint processes, as opposed to the interference freedom test [Owicki & Gries], being the proof theoretical analogue of concurrent communica

The Temporal Logic of Reactive and Concu
โœ Zohar Manna, Amir Pnueli ๐Ÿ“‚ Library ๐Ÿ“… 1991 ๐Ÿ› Springer ๐ŸŒ English

Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems, control systems, etc. They are among the most difficult computing systems to program. Temporal logic is a formal tool/language which yields excellent results in specifying

The Temporal Logic of Reactive and Concu
โœ Zohar Manna, Amir Pnueli (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Springer-Verlag New York ๐ŸŒ English

<p>Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems, control systems, etc. They are among the most difficult computing systems to program. Temporal logic is a formal tool/language which yields excellent results in specifyi

Models for Concurrency (Algebra, Logic a
โœ Uri Abraham ๐Ÿ“‚ Library ๐Ÿ“… 2020 ๐Ÿ› CRC Press ๐ŸŒ English

<p><span>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