Polynomials, fragments of temporal logic and the variety DA over traces

Authors:
Manfred Kufleitner
Affiliations:
FMI, Universität Stuttgart, Germany
Venue:
Theoretical Computer Science
Year:
2007

Citing 5
Cited 2

Parallel Program Schemata and Maximal Parallelism I. Fundamental Results

Journal of the ACM (JACM)
Automata, Languages, and Machines

Automata, Languages, and Machines
Varieties Of Formal Languages

Varieties Of Formal Languages
An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Trace Theory

Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II

On First-Order Fragments for Mazurkiewicz Traces

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Rankers over infinite words

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Quantified Score

Hi-index	5.24

Visualization

Abstract

We show that some language-theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To this end we give algebraic characterizations for the language operations of generating the polynomial closure and generating the unambiguous polynomial closure over traces. We also show that there exist natural fragments of local temporal logic that describe this class of languages corresponding to DA. All characterizations are known to hold for words.