Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00591139
Contributor : Benedikt Bollig <>
Submitted on : Thursday, June 23, 2011 - 5:29:00 PM
Last modification on : Thursday, May 24, 2018 - 9:34:04 AM
Long-term archiving on : Sunday, December 4, 2016 - 6:53:22 AM

Files

concurrent.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun. Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS 2011, Aug 2011, Warsaw, Poland. pp.132-144, ⟨10.1007/978-3-642-22993-0_15⟩. ⟨hal-00591139v2⟩

Share

Metrics

Record views

447

Files downloads

171