On axiomatic defintion of max-model of concurrency

  • Grazyna Mirkowska
  • Andrzej Salwicki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 280)


The thesis we present in this paper states that for every concurrent program π there exists a set of modal formulas, also called the axioms Ax(π), such that a) the structure of admissible parallel executions of the program π is a Kripke model of the set Ax(π) and, b) any Kripke model of the axioms Ax(π) is an extension of the structure of all admissible distributed (i.e. parallel) executions of the program π.


Modal Logic Propositional Variable Kripke Model Concurrent Program Communicate Sequential Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AFR]
    Apt K.R., Francez N., de Roever W.P., A Proof System for Communicating Sequential Processes, ACM TOPLAS, vol.2,No.3 (1980), 361–385CrossRefGoogle Scholar
  2. [BD]
    Best E., Devillers R., Concurrent Behaviour: Sequences, Processes and Programming Languages, GMD-Studien No.99 (1985)Google Scholar
  3. [EM]
    Enjalbert P., Michel M., Many-sorted Temporal Logic for Multiprocesses Systems, Proc. MFCS'84 (Chytil M. and Koubek V. eds) in LNCS 176, 1984, 273–282Google Scholar
  4. [F]
    Floyd R.W., Assigning Meanings to Programs, Proc.AMS (1967)Google Scholar
  5. [H]
    Hoare C.A.R., Communicating Sequential Processes, CACM 21 (1978), 666–677Google Scholar
  6. [K]
    Kripke S., Semantical analysis of modal logic II. The theory of Models, Amsterdam North-Holland 1965Google Scholar
  7. [L]
    Lamport L., Schneider F., The "Hoare Logic" of CSP and All That, TOPLAS 6 (1984), 281–295CrossRefGoogle Scholar
  8. [MS]
    Mirkowska G., Salwicki A., Algorithmic Logic, Warsaw, PWN-Reidel Publ. (1987)Google Scholar
  9. [OG]
    Owicki S., Gries D., An Axiomatic Proof Technique for Parallel Programs, Acta Informatica 6 (1976), 319–340CrossRefGoogle Scholar
  10. [SM]
    Salwicki A., Muldner T., On Algorithmic Properties of Concurrent Programs, in Logics of programs, Zurich 1979 (E.Engeler ed.) LNCS 125 (1981) Springer-Verlag, 169–197Google Scholar
  11. [R]
    de Roever W.P., The quest for compositionality — a survey of assertionbased Proof Systems for Concurrent Programs, Part I: Concurrency Based on Shared Variables, Proc. of the IFIP Working Conf. 1985 "The Role of Abstract Models in Computer Science" (E. J.Neuhold ed.) North-HollandGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Grazyna Mirkowska
    • 1
  • Andrzej Salwicki
    • 2
  1. 1.Polish Academy of Sciences ZSAKGliwice
  2. 2.Institute of InformaticsUniversity of WarsawPoland

Personalised recommendations