Paper Info
Title
Semantics and Completeness of Duration Calculus
Abstract
Duration Calculus was introduced in [1] as a notation to specify real-time systems, and as a calculus to verify theorems about such systems. Its distinctive feature is reasoning about durations of states within any time interval, without explicit mention of absolute time. Duration Calculus, which is an extension of Interval Temporal Logic, was originally designed to reason about real-time requirements for control systems; but it has been used at other levels of abstraction also: for example to give real-time semantics to communicating processes executed on a shared processor configuration and to reason about the correctness of a circuit transformation. The purpose of this paper is to introduce a formal syntax and semantics for Duration Calculus, and to prove its completeness — relative to the completeness of Interval Temporal Logic.
Year
DOI
Venue
1991
10.1007/BFb0031994
REX Workshop
Keywords
Field
DocType
verification.,duration calculus,real-time sys- tems,specification languages,interval temporal logic,relative completeness,specifications,proof system,specification language,real time,control system,real time systems
Notation,Programming language,Interval temporal logic,Computer science,Correctness,Formal grammar,Completeness (statistics),Process calculus,Semantics,Duration calculus
Conference
ISBN
Citations 
PageRank 
3-540-55564-1
37
3.49
References 
Authors
8
2
Name
Order
Citations
PageRank
Michael r. Hansen154343.29
Zhou Chaochen274344.43