The Complexity of CTL* + Linear Past

DOI10.1007/978-3-540-78499-9_14zbMath1139.68037OpenAlexW1562463698MaRDI QIDQ5458359

Laura Bozzelli

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (6)

A survey on temporal logics for specifying and verifying real-time systems ⋮ \textit{Once} and \textit{for all} ⋮ Alternating-time temporal logics with linear past ⋮ Unnamed Item ⋮ On the Complexity of Branching-Time Logics ⋮ Branching-time logics repeatedly referring to states

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchy of temporal logics with past
• Alternating automata on infinite trees
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Reasoning about infinite computations
• Specification in CTL + past for verification in CTL.
• “Sometimes” and “not never” revisited
• An automata-theoretic approach to branching-time model checking

This page was built for publication: The Complexity of CTL* + Linear Past