Logical Methods in Computer Science · 2010 · 12 citations · 15 references
ComputingComputer ScienceComputer SystemsFormal MethodsLogicMessage PassingFinite State Machine ModelingFinite-state MachinesModal LogicModel CheckingPropositional LogicTemporal LogicBounded Model CheckingChannelsDynamic LogicFinite State Machine SpecificationModel Checking Of Infinite-state SystemsMulti-modal LogicPropositional Temporal Logic
We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining an MSC language, we construct a communicating finite-state machine (CFM) accepting the same language. The CFM obtained has size exponential in the size of the formula. This synthesis problem is solved in full generality, i.e., also for MSCs with unbounded channels. The model checking problem for CFMs and HMSCs turns out to be in PSPACE for existentially bounded MSCs. Finally, we show that, for PDL with intersection, the semantics of a formula cannot be captured by a CFM anymore.
15
E. M. Clarke, Orna Grümberg, D. Long · 1996 · 6.9K citations
The temporal logic of programs
Amir Pnueli · 1977 · 5.7K citations
On Communicating Finite-State Machines
Daniël Brand, P. Zafiropulo · Journal of the ACM · 1983 · 1.1K citations · Full text