On the Expressiveness of MTL with Past Operators

DOI10.1007/11867340_23zbMATH Open1141.03311OpenAlexW1521742002MaRDI QIDQ3511245FDOQ3511245

Authors: Pavithra Prabhakar, Deepak D'Souza 

Publication date: 8 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11867340_23

Recommendations

• On the Expressiveness of MTL Variants over Dense Time
• scientific article; zbMATH DE number 5587267
• On the expressiveness of metric temporal logic over bounded timed words
• On the expressiveness of TPTL and MTL
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

Mathematics Subject Classification ID

Temporal logic (03B44)

Cited In (12)

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• An SMT-based approach to satisfiability checking of MITL
• Complexity of metric temporal logics with counting and the Pnueli modalities
• Title not available (Why is that?)
• On construction of safety signal automata for \(\mathrm{MITL}[\mathcal{U},\mathcal{S}]\) using temporal projections
• Metric temporal logic with counting
• Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers
• From non-punctuality to non-adjacency: a quest for decidability of timed temporal logics with quantifiers
• On the expressiveness of TPTL and MTL
• Generalizing Non-punctuality for Timed Temporal Logic with Freeze Quantifiers
• On the Expressiveness of MTL Variants over Dense Time
• Model-checking timed temporal logics

This page was built for publication: On the Expressiveness of MTL with Past Operators

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