Non-elementary lower bound for Propositional Duration Calculus

DOI10.1016/S0020-0190(98)00027-1zbMath0925.68062OpenAlexW1993397971MaRDI QIDQ1129106

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

ComplexityReal time systemsDuration CalculusPropositional Duration CalculusStar free expressions

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• A uniform method for proving lower bounds on the computational complexity of logical theories
• A calculus of durations
• Duration calculus: Logical foundations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item