 |
|
|
|
| HAL: hal-00591139, version 2 |
| DOI: 10.1007/978-3-642-22993-0_15 |
| Detailed view |  Export this paper |
|
|
| MFCS 2011, Warsaw : Poland (2011) |
|
|
| Available versions: | v1 (2011-05-06) | v2 (2011-06-24) |
|
|
|
|
| Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking |
|
|
| Benedikt Bollig 1Aiswarya Cyriac 1 |
|
|
| (2011-08) |
|
|
|
| We develop a general framework for the design of temporal logics for concurrent recursive programs. A program execution is modeled as a partial order with multiple nesting relations. To specify properties of executions, we consider any temporal logic whose modalities are definable in monadic second-order logic and that, in addition, allows PDL-like path expressions. This captures, in a unifying framework, a wide range of logics defined for ranked and unranked trees, nested words, and Mazurkiewicz traces that have been studied separately. We show that satisfiability and model checking are decidable in EXPTIME and 2EXPTIME, depending on the precise path modalities. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire Spécification et Vérification [Cachan] (LSV) |
|
|
|
CNRS : UMR8643 – INRIA – École normale supérieure de Cachan - ENS Cachan |
|
|
| 2: | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Formal Languages and Automata Theory |
|
|
| temporal logic – nested words – Mazurkiewicz traces |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00591139, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00591139 | |
| oai:hal.archives-ouvertes.fr:hal-00591139 | |
| From: Benedikt Bollig | |
| Submitted on: Thursday, 23 June 2011 17:29:00 | |
| Updated on: Monday, 9 January 2012 13:44:57 | |
