Weighted Logics for Traces

Abstract. We study a quantitative model of traces, i.e. trace series which assign to every trace an element from a semiring. We show the coincidence of recognizable trace series with those which are definable by restricted formulas from a weighted logics over traces. We use a translation technique from formulas over words to those over traces, and vice versa. This way, we show also the equivalence of aperiodic and first-order definable trace series.

• Type: Conference
• Year: 2006
• Where: CSR
• Authors: Ingmar Meinecke
• Keywords: CSR 2006, First-order Definable Trace, Recognizable Trace Series, Theoretical Computer Science, Trace Series