A logic for distributed transition systems
We present a logical characterization of a particular aspect of concurrency called the concurrent step notion. We do so by providing a sound and complete axiomatization of models called distributed transition systems. In a distributed transition system an old state is transformed into a new state through a set of actions occurring concurrently. Our logical language has the minimal features of linear time temporal logic and that of propositional dynamic logic. Our main result implies that satisfiability in our logical system is decidable.
Keywordsconcurrent step distributed transition systems axiomatization soundness completeness
Unable to display preview. Download preview PDF.
- [DDM]Degano, P., De Nicola, R. and Montanari, U. (1987): A Distributed Operational Semantics for CCS based on Condition/Event Systems. Nota Interna I.E.I. — B4 — 21, Department of Computer Science, University of Pisa (To appear in Acta Informatica).Google Scholar
- [HM]Hennessy, M. and Milner, R. (1980): On Observing Non-determinism and Concurrency, Springer Lecture Notes in Computer Science, 85, Springer-Verlag, pp 299–309.Google Scholar
- [K]Kröger, F. (1987): Temporal Logic of Programs. EATCS Monograph on Theoretical Computer Science, 8, Springer-Verlag.Google Scholar
- [LPZ]Lichtenstein, O., Pnueli, A. and Zuck, L. (1985): The Glory of the Past. In: Logic of Programs, Ed. R. Parikh, Springer Lecture Notes in Computer Science, 193, Springer-Verlag, pp 196–218.Google Scholar
- [M]Milner, R., (1980): A Calculus of Communicating Systems. Springer Lecture Notes in Computer Science, 92, Springer-Verlag.Google Scholar
- [O]Olderog, E.-R. (1987): Operational Petri Net Semantics for CCSP. In: Advances in Petri Nets, Ed. G. Rozenberg, Springer Lecture Notes in Computer Science, 266, Springer-Verlag, pp 381–400.Google Scholar
- [P]Parikh, R. (1988): Decidability and Undecidability in Distributed Transition systems (Unpublished Manuscript).Google Scholar