We introduce a weighted MSO-logic in which one outermost existential quantification over behaviours of a storage type is allowed. As weight structures we take unital valuation monoids which include all semirings, bounded lattices, and computations of average or discounted costs. Each formula is interpreted over finite words yielding elements in the weight structure. We prove that this logic is expressively equivalent to weighted automata with storage. In particular, this implies a Büchi-Elgot-Trakhtenbrot Theorem for weighted iterated pushdown languages. For this choice of storage type, the satisfiability problem of the logic is decidable for each bounded lattice provided that its infimum is computable.
CITATION STYLE
Vogler, H., Droste, M., & Herrmann, L. (2016). A weighted MSO logic with storage behaviour and its Büchi-Elgot-Trakhtenbrot theorem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9618, pp. 127–139). Springer Verlag. https://doi.org/10.1007/978-3-319-30000-9_10
Mendeley helps you to discover research relevant for your work.