In: de Bakker, J.W.; et al.: Lecture Notes in Computer Science, Vol. 354: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency., pages 508-522. Springer Verlag, 1989.
Abstract: The authors present a logical characterization of a particular aspect of concurrency called the concurrent step notion. They do so by providing a sound and complete axiomatization of models called distributed transition systems. In these systems an old state is transformaed into a new state through a set of actions occurring concurrently. The logical language has the minimal features of linear temporal logic and that of propositional dynamic logic. The main ressult implies that satisfiability in this logical system is decidable.
Keywords: axiomatization (of) >distributed transition system; step notion, (concurrent); linear temporal logic; propositional dynamic logic; decidability.