On the completeness and decidability of duration calculus with iteration
type: Item
instance of: scholarly article
title: On the completeness and decidability of duration calculus with iteration
zbMATH Open document ID: 1108.68074
author: Dimitar P. Guelev
author: Dang Van Hung
published in: Theoretical Computer Science
publication date: 2005-06-30T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 2184057
zbMATH Keywords: Real-time systems
zbMATH Keywords: Formal methods
zbMATH Keywords: Duration calculus
zbMATH Keywords: Completeness
zbMATH Keywords: Decidability
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.01.017
OpenAlex ID: W2041664178
cites work: Q4023900
cites work: A theory of timed automata
cites work: Q4501577
cites work: Q4472450
cites work: A Complete Proof System for First-order Interval Temporal Logic with Projection
cites work: Sharpening the incompleteness of the duration calculus
cites work: Duration calculus: Logical foundations
cites work: Q4493904
cites work: Results on the propositional \(\mu\)-calculus
cites work: Q3680239
cites work: Verification: Theory and Practice
cites work: Q5537599
cites work: Q3365587
cites work: Q3781066
cites work: Duration calculus. A formal approach to real-time systems.
cites work: Q4281508
cites work: A calculus of durations
DOI: 10.1016/J.TCS.2005.01.017
description: scientific article; zbMATH DE number 2184057