On the completeness and decidability of duration calculus with iteration

DOI10.1016/J.TCS.2005.01.017zbMath1108.68074OpenAlexW2041664178MaRDI QIDQ557828

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

Real-time systemsDecidabilityCompletenessFormal methodsDuration calculus

Mathematics Subject Classification ID

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

Related Items (2)

A survey on temporal logics for specifying and verifying real-time systems ⋮ A generalization of Arrow's lemma on extending a binary relation

Cites Work

• Results on the propositional \(\mu\)-calculus
• A calculus of durations
• A theory of timed automata
• Duration calculus: Logical foundations
• Duration calculus. A formal approach to real-time systems.
• A Complete Proof System for First-order Interval Temporal Logic with Projection
• Verification: Theory and Practice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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