Logics and Models of Concurrent Systems

  • Krzysztof R. Apt
Conference proceedings

Part of the NATO ASI Series book series (volume 13)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Temporal Logic

    1. Front Matter
      Pages 1-1
    2. E. M. Clarke, M. C. Browne, E. A. Emerson, A. P. Sistla
      Pages 3-26
    3. Luis Fariñas-del-Cerro
      Pages 27-55
    4. Brent Hailpern
      Pages 57-76
  3. Syntax Directed Verification Methods

    1. Front Matter
      Pages 145-145
    2. Nissim Francez, Brent Hailpern, Gadi Taubenfeld
      Pages 169-212
    3. Willem P. de Roever Jr.
      Pages 213-257
  4. Around CCS, Theoretical CSP and Distributed Systems

    1. Front Matter
      Pages 259-259
    2. G. Boudol
      Pages 261-303
    3. S. D. Brookes, A. W. Roscoe
      Pages 305-323
    4. Philippe Darondeau
      Pages 343-368
    5. Ernst-Rüdiger Olderog
      Pages 397-435
  5. Miscellaneous

    1. Front Matter
      Pages 437-437
    2. Joseph Y. Halpern, Yoram Moses
      Pages 459-476
    3. D. Harel, A. Pnueli
      Pages 477-498
  6. Back Matter
    Pages 499-499

About these proceedings


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.


Invariant Programm Systems algorithms communicating sequential process cooperation distributed systems form logic maintenance programming programming language semantics sound verification

Editors and affiliations

  • Krzysztof R. Apt
    • 1
  1. 1.L.I.T.P.Université Paris 7ParisFrance

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 1985
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-82455-5
  • Online ISBN 978-3-642-82453-1
  • Buy this book on publisher's site