Completeness and Complexity of Multi-modal CTL

DOI10.1016/j.entcs.2009.02.040zbMath1347.03028OpenAlexW2106363087MaRDI QIDQ4982125

Michael Wooldridge, Wiebe van der Hoek, Thomas Ågotnes

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.02.040

zbMATH Keywords

completenesstemporal logicfusioncomputation tree logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items

A logic of situated resource-bounded agents ⋮ Multi-modal CTL: completeness, complexity, and an application

Cites Work

• Adding a temporal dimension to a logic system
• Simulation and transfer results in modal logic -- a survey
• Many-dimensional modal logics: theory and applications
• Combining temporal logic systems
• Decision procedures and expressiveness in the temporal logic of branching time
• Using the Universal Modality: Gains and Questions
• The Unrestricted Combination of Temporal Logic Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item