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.
CITATION STYLE
Lodaya, K., Ramanujam, R., & Thiagarajan, P. S. (1989). A logic for distributed transition systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 354 LNCS, pp. 508–522). Springer Verlag. https://doi.org/10.1007/BFb0013033
Mendeley helps you to discover research relevant for your work.