On the completeness and decidability of duration calculus with iteration

DOI10.1016/J.TCS.2005.01.017zbMATH Open1108.68074OpenAlexW2041664178MaRDI QIDQ557828FDOQ557828

Dimitar P. Guelev, Dang Van Hung

Publication date: 30 June 2005

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.017

Recommendations

• scientific article; zbMATH DE number 1500558
• scientific article; zbMATH DE number 1670495
• scientific article; zbMATH DE number 2080208
• scientific article; zbMATH DE number 512815
• A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus

zbMATH Keywords

CompletenessDecidabilityDuration calculusFormal methodsReal-time systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• A theory of timed automata
• Title not available (Why is that?)
• Duration calculus. A formal approach to real-time systems.
• Title not available (Why is that?)
• Results on the propositional \(\mu\)-calculus
• A calculus of durations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Duration calculus: Logical foundations
• Sharpening the incompleteness of the duration calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Complete Proof System for First-order Interval Temporal Logic with Projection
• Verification: Theory and Practice

Cited In (8)

• Automata for a decidable subset of duration calculus.
• A survey on temporal logics for specifying and verifying real-time systems
• Title not available (Why is that?)
• Take It NP-Easy: Bounded Model Construction for Duration Calculus
• Decidability of a hybrid duration calculus
• Title not available (Why is that?)
• A generalization of Arrow's lemma on extending a binary relation
• A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus

This page was built for publication: On the completeness and decidability of duration calculus with iteration

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