On the completeness and decidability of duration calculus with iteration

DOI10.1016/J.TCS.2005.01.017MaRDI QIDQ557828zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cites work

• scientific article; zbMATH DE number 5000355 (Why is no real title available?)
• scientific article; zbMATH DE number 3901996 (Why is no real title available?)
• scientific article; zbMATH DE number 4041866 (Why is no real title available?)
• scientific article; zbMATH DE number 108434 (Why is no real title available?)
• scientific article; zbMATH DE number 512815 (Why is no real title available?)
• scientific article; zbMATH DE number 2080208 (Why is no real title available?)
• scientific article; zbMATH DE number 1487495 (Why is no real title available?)
• scientific article; zbMATH DE number 1500558 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• A Complete Proof System for First-order Interval Temporal Logic with Projection
• A calculus of durations
• A hierarchical completeness proof for propositional temporal logic
• A theory of timed automata
• Duration calculus. A formal approach to real-time systems.
• Duration calculus: Logical foundations
• Results on the propositional \(\mu\)-calculus
• Sharpening the incompleteness of the duration calculus

Cited in

(10)

• A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus
• Automata for a decidable subset of duration calculus.
• A survey on temporal logics for specifying and verifying real-time systems
• scientific article; zbMATH DE number 2080208 (Why is no real title available?)
• Take It NP-Easy: Bounded Model Construction for Duration Calculus
• Decidability of a hybrid duration calculus
• Prefix and projection onto state in duration calculus
• A generalization of Arrow's lemma on extending a binary relation
• scientific article; zbMATH DE number 1670495 (Why is no real title available?)
• Sharpening the incompleteness of 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)