Asynchronous cellular automata for infinite traces

DOI10.1007/3-540-55719-9_106MaRDI QIDQ5204349zbMATH OpenOpenAlexFDO

Authors Paul Gastin, A. 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

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

Recommendations

• Deterministic asynchronous automata for infinite traces
• scientific article; zbMATH DE number 512867
• Asynchronous automata versus asynchronous cellular automata
• Notes on finite asynchronous automata
• scientific article; zbMATH DE number 4112050

Cites work

• A metric for traces
• Asynchronous cellular automata for infinite traces
• Asynchronous mappings and asynchronous cellular automata
• Combinatorics on traces
• scientific article; zbMATH DE number 4030996 (Why is no real title available?)
• scientific article; zbMATH DE number 4112050 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 48095 (Why is no real title available?)
• scientific article; zbMATH DE number 176133 (Why is no real title available?)
• scientific article; zbMATH DE number 176496 (Why is no real title available?)
• scientific article; zbMATH DE number 176497 (Why is no real title available?)
• scientific article; zbMATH DE number 176739 (Why is no real title available?)
• scientific article; zbMATH DE number 176754 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• Notes on finite asynchronous automata
• The poset of infinitary traces
• Theory of traces

Cited in

(22)

• An extension of Kleene's and Ochmański's theorems to infinite traces
• Asynchronous automata versus asynchronous cellular automata
• Deterministic asynchronous automata for infinite traces
• On the complementation of asynchronous cellular Büchi automata
• Asynchronous cellular automata for pomsets
• Classifying recognizable infinitary trace languages using word automata
• An expressively complete linear time temporal logic for Mazurkiewicz traces
• Classifying recognizable infinitary trace languages using word automata
• Ultimate traces of cellular automata
• Inferring regular trace languages from positive and negative samples
• scientific article; zbMATH DE number 4112050 (Why is no real title available?)
• An extension of the notions of traces and of asynchronous automata
• scientific article; zbMATH DE number 176496 (Why is no real title available?)
• scientific article; zbMATH DE number 512867 (Why is no real title available?)
• Logical definability on infinite traces
• Determinizing asynchronous automata
• On the complementation of Büchi asynchronous cellular automata
• Keeping track of the latest gossip in a distributed system
• Asynchronous cellular automata for infinite traces
• Logical definability on infinite traces
• Asynchronous mappings and asynchronous cellular automata
• Muller message-passing automata and logics

This page was built for publication: Asynchronous cellular automata for infinite traces

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