Decidability of a hybrid duration calculus
From MaRDI portal
Publication:2867952
DOI10.1016/J.ENTCS.2006.11.029zbMATH Open1278.03040OpenAlexW2072122432MaRDI QIDQ2867952FDOQ2867952
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
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
Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70)
Cites Work
- Modal logic
- Title not available (Why is that?)
- Towards a general theory of action and time
- Duration calculus. A formal approach to real-time systems.
- A propositional modal logic of time intervals
- A Road Map of Interval Temporal Logics and Duration Calculi
- Weak Second‐Order Arithmetic and Finite Automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- A calculus of durations
- Proof methods for modal and intuitionistic logics
- On the decidability of continuous time specification formalisms
- Duration calculus: Logical foundations
- Title not available (Why is that?)
- Automated Reasoning with Analytic Tableaux and Related Methods
- Title not available (Why is that?)
- Model-checking dense-time duration calculus
- Non-elementary lower bound for Propositional Duration Calculus
- A mixed decision method for duration calculus
- Take It NP-Easy: Bounded Model Construction for Duration Calculus
- Spatio-temporal Model Checking for Mobile Real-Time Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- A practical approach to model checking duration calculus using Presburger arithmetic
- Automata for a decidable subset of duration calculus.
- Hybrid metric propositional neighborhood logics with interval length binders
- A mixed decision method for duration calculus
- Take It NP-Easy: Bounded Model Construction for Duration Calculus
- Title not available (Why is that?)
- Prefix and projection onto state in duration calculus
- A duration calculus with neighborhood modalities.
Uses Software
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)
