Bollig, Benedikt and Kuske, Dietrich and Meinecke, Ingmar - Propositional Dynamic Logic for Message-Passing Systems

lmcs:1057 - Logical Methods in Computer Science, September 4, 2010, Volume 6, Issue 3
Propositional Dynamic Logic for Message-Passing Systems

Authors: Bollig, Benedikt and Kuske, Dietrich and Meinecke, Ingmar

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.


Source : oai:arXiv.org:1007.4764
DOI : 10.2168/LMCS-6(3:16)2010
Volume: Volume 6, Issue 3
Published on: September 4, 2010
Submitted on: June 5, 2009
Keywords: Computer Science - Logic in Computer Science,F.3.1


Share

Consultation statistics

This page has been seen 53 times.
This article's PDF has been downloaded 58 times.