On axiomatic defintion of max-model of concurrency
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 π.
KeywordsModal Logic Propositional Variable Kripke Model Concurrent Program Communicate Sequential Process
Unable to display preview. Download preview PDF.
- [BD]Best E., Devillers R., Concurrent Behaviour: Sequences, Processes and Programming Languages, GMD-Studien No.99 (1985)Google Scholar
- [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
- [F]Floyd R.W., Assigning Meanings to Programs, Proc.AMS (1967)Google Scholar
- [H]Hoare C.A.R., Communicating Sequential Processes, CACM 21 (1978), 666–677Google Scholar
- [K]Kripke S., Semantical analysis of modal logic II. The theory of Models, Amsterdam North-Holland 1965Google Scholar
- [MS]Mirkowska G., Salwicki A., Algorithmic Logic, Warsaw, PWN-Reidel Publ. (1987)Google Scholar
- [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
- [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