The unary fragments of metric interval temporal logic: bounded versus lower bound constraints

DOI10.1007/978-3-642-33386-6_8MaRDI QIDQ4649289zbMATH OpenOpenAlexFDO

Authors Paritosh K. Pandya, Simoni S. Shah

Publication date 21 November 2012

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-33386-6_8

Mathematics Subject Classification ID

Temporal logic (03B44) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• On Unary Fragments of MTL and TPTL over Timed Words
• Expressive completeness for metric temporal logic
• Some Recent Results in Metric Temporal Logic
• Parametric Metric Interval Temporal Logic
• On the expressiveness of metric temporal logic over bounded timed words

Cited in

(3)

• Satisfiability checking for mission-time \textsf{LTL} (MLTL)
• On Unary Fragments of MTL and TPTL over Timed Words
• Satisfiability checking of multi-variable TPTL with unilateral intervals is PSPACE-complete

This page was built for publication: The unary fragments of metric interval temporal logic: bounded versus lower bound constraints

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