Propositional Dynamic Logic for Message-Passing Systems

Details Propositional Dynamic Logic for Message-Passing Systems Propositional Dynamic Logic for Message-Passing Systems

2010-07-27

arxiv.org/abs/1007.4764v3

LMCS 6 (3:16) 2010

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-6(3:16)2010

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.

Affiliated with

Also associated with

No associations

Rating

Propositional Dynamic Logic for Message-Passing Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Propositional Dynamic Logic for Message-Passing Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Propositional Dynamic Logic for Message-Passing Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-321602