Expressive completeness of duration calculus.

DOI10.1006/inco.1999.2816zbMath1046.68606OpenAlexW2028484769MaRDI QIDQ1854330

Alexander Rabinovich

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/899cbb171ccc7fd45f721b6673764e3051fd8995

zbMATH Keywords

first-order monadic logicspecification of real-time systems

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

A duration calculus with neighborhood modalities ⋮ Bounded variability of metric temporal logic ⋮ Algebraic neighbourhood logic ⋮ A first order logic for specification of timed algorithms: Basic properties and a decidable class

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-elementary lower bound for Propositional Duration Calculus
• A calculus of durations
• Duration calculus: Logical foundations
• Star free expressions over the reals
• Star-free regular sets of ω-sequences
• On the decidability of continuous time specification formalisms
• A duration calculus with infinite intervals