Decidability of a Hybrid Duration Calculus

DOI10.1016/j.entcs.2006.11.029zbMath1278.03040MaRDI QIDQ2867952

Thomas Bolander, Jens Ulrik Hansen, Michael R. Hansen

Publication date: 20 December 2013

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.2006.11.029

zbMATH Keywords

hybrid logic; duration calculus; decision methods; monadic second-order theory of order

Mathematics Subject Classification ID

03B70: Logic in computer science

03B25: Decidability of theories and sets of sentences

03B44: Temporal logic

Related Items

Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders, A practical approach to model checking duration calculus using Presburger arithmetic, A duration calculus with neighborhood modalities

Uses Software

• MONA
• DCVALID

Cites Work

• Proof methods for modal and intuitionistic logics
• Towards a general theory of action and time
• Non-elementary lower bound for Propositional Duration Calculus
• A calculus of durations
• Duration calculus: Logical foundations
• Duration calculus. A formal approach to real-time systems.
• Model-checking dense-time duration calculus
• Weak Second‐Order Arithmetic and Finite Automata
• Spatio-temporal Model Checking for Mobile Real-Time Systems
• Decision Problems of Finite Automata Design and Related Arithmetics
• On the decidability of continuous time specification formalisms
• A propositional modal logic of time intervals
• A mixed decision method for duration calculus
• Take It NP-Easy: Bounded Model Construction for Duration Calculus
• Automated Reasoning with Analytic Tableaux and Related Methods
• A Road Map of Interval Temporal Logics and Duration Calculi
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item