Asynchronous mappings and asynchronous cellular automata
From MaRDI portal
Publication:690237
DOI10.1006/inco.1993.1052zbMath0785.68068OpenAlexW2001042198MaRDI QIDQ690237
Robert Cori, Wiesław Zielonka, Yves Métivier
Publication date: 20 April 1994
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1993.1052
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80)
Related Items (34)
Asynchronous automata versus asynchronous cellular automata ⋮ Deterministic asynchronous automata for infinite traces ⋮ Regular sets of infinite message sequence charts ⋮ Pattern matching in trace monoids ⋮ Automated Synthesis of Distributed Controllers ⋮ On the complementation of asynchronous cellular Büchi automata ⋮ Distributed Asynchronous Automata ⋮ A study on delay-sensitive cellular automata ⋮ The monadic second-order logic of graphs. X: Linear orderings ⋮ On Distributed Monitoring and Synthesis ⋮ A quadratic construction for Zielonka automata with acyclic communication structure ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Asynchronous cellular automata for pomsets without auto-concurrency ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ MSO Logic for Unambiguous Shared-Memory Systems ⋮ Semantics of Deterministic Shared-Memory Systems ⋮ Keeping track of the latest gossip in a distributed system ⋮ Determinizing asynchronous automata ⋮ On the complementation of Büchi asynchronous cellular automata ⋮ Basic notions of universal algebra for language theory and graph grammars ⋮ COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS ⋮ A framework for synthesis of communicating decentralised supervisors for discrete-event systems ⋮ A model for learning the news in social networks ⋮ UNAMBIGUOUS SHARED-MEMORY SYSTEMS ⋮ Compositional synthesis of asynchronous automata ⋮ Time-stamps for Mazurkiewicz traces. ⋮ Local testability from words to traces, a suitable definition ⋮ Asynchronous cellular automata for infinite traces ⋮ Weighted asynchronous cellular automata ⋮ Asynchronous cellular automata for pomsets ⋮ Distributed automata in an assumption-commitment framework ⋮ Bounded time-stamping in message-passing systems ⋮ An extension of Kleene's and Ochmański's theorems to infinite traces ⋮ Resource traces: A domain for processes sharing exclusive resources.
This page was built for publication: Asynchronous mappings and asynchronous cellular automata
