Kuperberg, Denis - Linear Temporal Logic for Regular Cost Functions

lmcs:1222 - Logical Methods in Computer Science, February 4, 2014, Volume 10, Issue 1
Linear Temporal Logic for Regular Cost Functions

Authors: Kuperberg, Denis

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 two dual form of cost automata, and we show that the natural decision problems for this logic are PSPACE-complete, as it is the case in the classical setting. We then algebraically characterize the expressive power of this logic, using a new syntactic congruence for cost functions introduced in this paper.

Source : oai:arXiv.org:1401.1448
DOI : 10.2168/LMCS-10(1:4)2014
Volume: Volume 10, Issue 1
Published on: February 4, 2014
Submitted on: February 22, 2013
Keywords: Computer Science - Logic in Computer Science,Computer Science - Formal Languages and Automata Theory


Consultation statistics

This page has been seen 75 times.
This article's PDF has been downloaded 97 times.