Propositional Dynamic Logic for Message-Passing Systems

Benedikt Bollig 1 Dietrich Kuske Ingmar Meinecke
1 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
Abstract : 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.
Type de document :
Article dans une revue
Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2010, 6 (3:16), 〈10.2168/LMCS-6(3:16)2010〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00779914
Contributeur : Stefan Haar <>
Soumis le : mardi 22 janvier 2013 - 17:05:41
Dernière modification le : jeudi 11 janvier 2018 - 06:23:37

Identifiants

Collections

Citation

Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke. Propositional Dynamic Logic for Message-Passing Systems. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2010, 6 (3:16), 〈10.2168/LMCS-6(3:16)2010〉. 〈hal-00779914〉

Partager

Métriques

Consultations de la notice

111