Sharpening the Incompleteness of the Duration Calculus

Authors:
Dimitar P. Guelev
Affiliations:
School of Computer Science, The University of Birmingham, UK, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 7
Cited 0

Executing temporal logic programs

Executing temporal logic programs
Decidability and Undecidability Results for Duration Calculus

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Semantics and Completeness of Duration Calculus

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Complete Proof Systems for First Order Interval Temporal Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)

Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)
A Temporal Logic for Multilevel Reasoning about Hardware

Computer

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the particularly narrow subset of the duration calculus which is defined by the BNF@f::=@?|@?S@?|A|@f@?@f|(@f;@f) is not recursively axiomatisable or, in other words, incomplete.