Asynchronous cellular automata for infinite traces

DOI10.1007/3-540-55719-9_106zbMath1425.68281OpenAlexW1497903619MaRDI QIDQ5204349

Paul Gastin, Antoine Petit

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_106

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Cellular automata (computational aspects) (68Q80)

Related Items

Asynchronous automata versus asynchronous cellular 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, Keeping track of the latest gossip in a distributed system, Determinizing asynchronous automata, On the complementation of Büchi asynchronous cellular automata, Logical definability on infinite traces, Muller message-passing automata and logics, An expressively complete linear time temporal logic for Mazurkiewicz traces, Asynchronous cellular automata for infinite traces, Logical definability on infinite traces, An extension of Kleene's and Ochmański's theorems to infinite traces

Cites Work

• The poset of infinitary traces
• Asynchronous mappings and asynchronous cellular automata
• A metric for traces
• Theory of traces
• Combinatorics on traces
• Notes on finite asynchronous automata
• Asynchronous cellular automata for infinite traces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item