Completeness of higher-order duration calculus

DOI10.1007/3-540-44622-2_30MaRDI QIDQ2753691zbMATH OpenFDO

Authors Naijun Zhan

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44622-2_30

zbMATH Keywords

completenessduration calculushigher-order logicinterval temporal logic

Mathematics Subject Classification ID

Temporal logic (03B44) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Expressive completeness of duration calculus.
• A complete fragment of higher-order duration -calculus
• On the completeness and decidability of duration calculus with iteration
• Duration calculus: Logical foundations
• Advanced features of duration calculus and their applications in sequential hybrid programs

Cited in

(5)

• Expressive completeness of duration calculus.
• A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus
• A complete fragment of higher-order duration -calculus
• On the completeness and decidability of duration calculus with iteration
• A complete proof system for HyperLTL

This page was built for publication: Completeness of higher-order duration calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753691)