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. © 2011 Springer-Verlag GmbH.
CITATION STYLE
Bollig, B., Cyriac, A., Gastin, P., & Zeitoun, M. (2011). Temporal logics for concurrent recursive programs: Satisfiability and model checking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6907 LNCS, pp. 132–144). https://doi.org/10.1007/978-3-642-22993-0_15
Mendeley helps you to discover research relevant for your work.