Asynchronous automata-theoretic characterization of aperiodic trace languages

Authors:
Bharat Adsul;Milind Sohoni
Affiliations:
Chennai Mathematical Institute, Chennai, India;Department of Computer Sc and Engg, Indian Institute of Technology, Mumbai, India
Venue:
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2004

Citing 7
Cited 0

Star-free trace languages

Theoretical Computer Science
Languages, automata, and logic

Handbook of formal languages, vol. 3
The Book of Traces

The Book of Traces
Logical Definability on Infinite Traces

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Languages and Logical Definability in Concurrency Monoids

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Keeping track of the latest gossip in a distributed system

Distributed Computing
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We characterize aperiodic distributed behaviours, modelled as Mazurkiewicz traces in terms of a very natural cascade product of the gossip automaton with a counter-free asynchronous automaton. The characterization strengthens the fundamental results of Schutzenberger and, McNaughton and Papert and implies that star-free, equivalently, first-order-definable trace languages admit counter-free asynchronous acceptors modulo the gossip automaton.