Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2011.627
URN: urn:nbn:de:0030-drops-30499
URL: https://drops.dagstuhl.de/opus/volltexte/2011/3049/
Kuperberg, Denis
Linear temporal logic for regular cost functions
| pdf-format: |
|
Abstract
Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is that exact values are not considered, but only estimated.In this paper, we define an extension of Linear Temporal Logic (LTL) over finite words to describe cost functions. We give an explicit translation from this new logic to automata. We then algebraically characterize the expressive power of this logic, using a new syntactic congruence for cost functions introduced in this paper.
BibTeX - Entry
@InProceedings{kuperberg:LIPIcs:2011:3049,
author = {Denis Kuperberg},
title = {{Linear temporal logic for regular cost functions}},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) },
pages = {627--636},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-25-5},
ISSN = {1868-8969},
year = {2011},
volume = {9},
editor = {Thomas Schwentick and Christoph D{\"u}rr},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3049},
URN = {urn:nbn:de:0030-drops-30499},
doi = {10.4230/LIPIcs.STACS.2011.627},
annote = {Keywords: linear temporal logic, regular cost functions, regular languages}
}
| Keywords: | linear temporal logic, regular cost functions, regular languages | |
| Seminar: | 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) | |
| Issue date: | 2011 | |
| Date of publication: | 11.03.2011 |
