Decidability of a hybrid duration calculus

DOI10.1016/J.ENTCS.2006.11.029MaRDI QIDQ2867952zbMATH OpenOpenAlexFDO

Authors 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 logicdecision methodsduration calculusmonadic second-order theory of order

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 512815
• On the completeness and decidability of duration calculus with iteration
• Axiomatisation and decidability of multi-dimensional Duration Calculus
• scientific article; zbMATH DE number 1500558
• Compositional Hoare-style reasoning about hybrid CSP in the duration calculus
• On the decidability of continuous time specification formalisms
• Decidable hybrid systems
• Expressive completeness of duration calculus.
• scientific article; zbMATH DE number 6533399
• scientific article; zbMATH DE number 1444359

Cites work

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

Cited in

(8)

• scientific article; zbMATH DE number 2044758 (Why is no real title available?)
• Take It NP-Easy: Bounded Model Construction for Duration Calculus
• A practical approach to model checking duration calculus using Presburger arithmetic
• Hybrid metric propositional neighborhood logics with interval length binders
• Automata for a decidable subset of duration calculus.
• A duration calculus with neighborhood modalities.
• Prefix and projection onto state in duration calculus
• A mixed decision method for duration calculus

Describes a project that uses

Uses Software

• MONA
• DCVALID

This page was built for publication: Decidability of a hybrid duration calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867952)