The Unary Fragments of Metric Interval Temporal Logic: Bounded versus Lower bound Constraints (Full Version)

Preprint English OPEN
Pandya, Paritosh K.; Shah, Simoni S.;
  • Related identifiers: doi: 10.1007/978-3-642-33386-6
  • Subject: Computer Science - Formal Languages and Automata Theory | Computer Science - Logic in Computer Science

We study two unary fragments of the well-known metric interval temporal logic MITL[U_I,S_I] that was originally proposed by Alur and Henzinger, and we pin down their expressiveness as well as satisfaction complexities. We show that MITL[F_\inf,P_\inf] which has unary mo... View more
Share - Bookmark