Deterministic asynchronous automata for infinite traces

DOI10.1007/BF01178512zbMATH Open0818.68100MaRDI QIDQ1338892FDOQ1338892

Authors: Volker Diekert, Anca Muscholl 

Publication date: 23 November 1994

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

Recommendations

• scientific article; zbMATH DE number 512867
• Determinizing asynchronous automata
• An extension of the notions of traces and of asynchronous automata
• scientific article; zbMATH DE number 3911715
• scientific article; zbMATH DE number 3995056
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Asynchronous trace-matching automata
• Asynchronous cellular automata for infinite traces
• Determinizing Büchi asynchronous automata
• Notes on finite asynchronous automata

zbMATH Keywords

Muller automatoninfinite tracesnon-terminating concurrent systems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• Muller message-passing automata and logics
• Title not available (Why is that?)
• Regular sets of infinite message sequence charts
• Logical definability on infinite traces
• Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
• Title not available (Why is that?)
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Recognizable and logically definable languages of infinite computations in concurrent automata
• 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
• Asynchronous cellular automata for infinite traces
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338892)