Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ben-Ari, M., Halpern, J.Y. and Pnueli, A. (1982): Deterministic Propositional Dynamic Logic: Finite Models, Complexity and Completeness. J. Comput. Syst. Sci., 25, pp. 402–417.
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).
Fischer, M.J. and Ladner, R.E. (1979): Propositional Dynamic Logic of Regular Programs. J. Comput. Syst. Sci., 18, pp 194–211.
Hennessy, M. and Milner, R. (1980): On Observing Non-determinism and Concurrency, Springer Lecture Notes in Computer Science, 85, Springer-Verlag, pp 299–309.
Kröger, F. (1987): Temporal Logic of Programs. EATCS Monograph on Theoretical Computer Science, 8, Springer-Verlag.
Kozen, D. and Parikh, R. (1982): An Elementary Proof of Completeness of PDL. Theor. Comput. Sci., 14, pp 113–118.
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.
Milner, R., (1980): A Calculus of Communicating Systems. Springer Lecture Notes in Computer Science, 92, Springer-Verlag.
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.
Parikh, R. (1988): Decidability and Undecidability in Distributed Transition systems (Unpublished Manuscript).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lodaya, K., Ramanujam, R., Thiagarajan, P.S. (1989). A logic for distributed transition systems. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. REX 1988. Lecture Notes in Computer Science, vol 354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013033
Download citation
DOI: https://doi.org/10.1007/BFb0013033
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51080-2
Online ISBN: 978-3-540-46147-0
eBook Packages: Springer Book Archive