Non-elementary lower bound for Propositional Duration Calculus

DOI10.1016/S0020-0190(98)00027-1MaRDI QIDQ1129106zbMATH OpenOpenAlexFDO

Authors Alexander Rabinovich

Publication date 13 August 1998

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(98)00027-1

zbMATH Keywords

ComplexityDuration CalculusReal time systemsPropositional Duration CalculusStar free expressions

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Cites work

• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 1231602 (Why is no real title available?)
• scientific article; zbMATH DE number 512815 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A calculus of durations
• A uniform method for proving lower bounds on the computational complexity of logical theories
• Duration calculus: Logical foundations

Cited in

(6)

• Expressive completeness of duration calculus.
• A Road Map of Interval Temporal Logics and Duration Calculi
• A survey on temporal logics for specifying and verifying real-time systems
• A Road Map of Interval Temporal Logics and Duration Calculi
• Decidability of a hybrid duration calculus
• Star free expressions over the reals

This page was built for publication: Non-elementary lower bound for Propositional Duration Calculus

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