Deterministic asynchronous automata for infinite traces

DOI10.1007/BF01178512zbMath0818.68100MaRDI QIDQ1338892

Anca Muscholl, Volker Diekert

Publication date: 23 November 1994

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

Muller automatoninfinite tracesnon-terminating concurrent systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (7)

Regular sets of infinite message sequence charts ⋮ On the complementation of asynchronous cellular Büchi automata ⋮ Classifying Recognizable Infinitary Trace Languages Using Word Automata ⋮ Classifying recognizable infinitary trace languages using word automata ⋮ Logical definability on infinite traces ⋮ Muller message-passing automata and logics ⋮ RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA

Cites Work

• The poset of infinitary traces
• Asynchronous mappings and asynchronous cellular automata
• A metric for traces
• A syntactic congruence for rational \(\omega\)-languages
• Combinatorics on traces
• Combinatorial problems of commutation and rearrangements
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deterministic asynchronous automata for infinite traces