Adequacy and complete axiomatization for timed modal logic

DOI10.1016/J.ENTCS.2014.10.011zbMath1337.03028OpenAlexW2025347290WikidataQ113317844 ScholiaQ113317844MaRDI QIDQ283762

Samy Jaziri, Bingtian Xue, Radu Mardare, Kim Guldstrand Larsen

Publication date: 13 May 2016

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

zbMATH Keywords

complete axiomatizationnon-compact modal logicstimed modal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

Alternation-free weighted mu-calculus: decidability and completeness ⋮ Unnamed Item ⋮ On decidability of recursive weighted logics

Cites Work

• Unnamed Item
• Unnamed Item
• Model-checking in dense real-time
• Real-time logics: Complexity and expressiveness
• A theory of timed automata
• Symbolic model checking for real-time systems
• Introduction to Boolean Algebras
• From timed automata to logic — and back
• On the role of the Baire Category Theorem and Dependent Choice in the foundations of logic
• A really temporal logic
• The benefits of relaxing punctuality
• Stone Duality for Markov Processes
• Reactive Systems
• On the decidability and complexity of Metric Temporal Logic over finite words
• A proof of the completeness theorem of Grödel
• Foundations of Software Science and Computation Structures
• Axioms for real-time logics
• Modularity for timed and hybrid systems

This page was built for publication: Adequacy and complete axiomatization for timed modal logic