Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.77
URN: urn:nbn:de:0030-drops-81112
URL: https://drops.dagstuhl.de/opus/volltexte/2017/8111/
Krishna, Shankara Narayanan ; Madnani, Khushraj ; Pandya, Paritosh K.
Making Metric Temporal Logic Rational
| pdf-format: |
|
Abstract
We study an extension of MTL in pointwise time with regular expression guarded modality Reg_I(re) where re is a rational expression over subformulae. We study the decidability and expressiveness of this extension (MTL+Ureg+Reg), called RegMTL, as well as its fragment SfrMTL where only star-free rational expressions are allowed. Using the technique of temporal projections, we show that RegMTL has decidable satisfiability by giving an equisatisfiable reduction to MTL. We also identify a subclass MITL+UReg of RegMTL for which our equisatisfiable reduction gives rise to formulae of MITL, yielding elementary decidability. As our second main result, we show a tight automaton-logic connection between SfrMTL and partially ordered (or very weak) 1-clock alternating timed automata.
BibTeX - Entry
@InProceedings{krishna_et_al:LIPIcs:2017:8111,
author = {Shankara Narayanan Krishna and Khushraj Madnani and Paritosh K. Pandya},
title = {{Making Metric Temporal Logic Rational}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {77:1--77:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8111},
URN = {urn:nbn:de:0030-drops-81112},
doi = {10.4230/LIPIcs.MFCS.2017.77},
annote = {Keywords: Metric Temporal Logic, Timed Automata, Regular Expression, Equisatisfiability, Expressiveness}
}
| Keywords: | Metric Temporal Logic, Timed Automata, Regular Expression, Equisatisfiability, Expressiveness | |
| Seminar: | 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 01.12.2017 |
