eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2020-08-18
21:1
21:14
10.4230/LIPIcs.MFCS.2020.21
article
On a Temporal Logic of Prefixes and Infixes
Bozzelli, Laura
1
Montanari, Angelo
2
Peron, Adriano
1
Sala, Pietro
3
Department of Electric Engineering and Information Technology, University Federico II, Naples, Italy
Department of Computer Science, Mathematics, and Physics, University of Udine, Italy
Department of Computer Science, University of Verona, Italy
A classic result by Stockmeyer [Stockmeyer, 1974] gives a non-elementary lower bound to the emptiness problem for star-free generalized regular expressions. This result is intimately connected to the satisfiability problem for interval temporal logic, notably for formulas that make use of the so-called chop operator. Such an operator can indeed be interpreted as the inverse of the concatenation operation on regular languages, and this correspondence enables reductions between non-emptiness of star-free generalized regular expressions and satisfiability of formulas of the interval temporal logic of the chop operator under the homogeneity assumption [Halpern et al., 1983]. In this paper, we study the complexity of the satisfiability problem for a suitable weakening of the chop interval temporal logic, that can be equivalently viewed as a fragment of Halpern and Shoham interval logic featuring the operators B, for "begins", corresponding to the prefix relation on pairs of intervals, and D, for "during", corresponding to the infix relation. The homogeneous models of the considered logic naturally correspond to languages defined by restricted forms of regular expressions, that use union, complementation, and the inverses of the prefix and infix relations.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol170-mfcs2020/LIPIcs.MFCS.2020.21/LIPIcs.MFCS.2020.21.pdf
Interval Temporal Logic
Star-Free Regular Languages
Satisfiability
Complexity