Asynchronous mappings and asynchronous cellular automata
From MaRDI portal
Publication:690237
DOI10.1006/INCO.1993.1052zbMATH Open0785.68068OpenAlexW2001042198MaRDI QIDQ690237FDOQ690237
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)
Cited In (40)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- On the complementation of Büchi asynchronous cellular automata
- Bounded time-stamping in message-passing systems
- Keeping track of the latest gossip in a distributed system
- Asynchronous cellular automata for pomsets
- Resource traces: A domain for processes sharing exclusive resources.
- A quadratic construction for Zielonka automata with acyclic communication structure
- Deterministic asynchronous automata for infinite traces
- The monadic second-order logic of graphs. X: Linear orderings
- Compositional synthesis of asynchronous automata
- Basic notions of universal algebra for language theory and graph grammars
- A framework for synthesis of communicating decentralised supervisors for discrete-event systems
- Asynchronous automata versus asynchronous cellular automata
- Local testability from words to traces, a suitable definition
- A model for learning the news in social networks
- Regular sets of infinite message sequence charts
- Computation by asynchronously updating cellular automata
- A study on delay-sensitive cellular automata
- Weighted asynchronous cellular automata
- Time-stamps for Mazurkiewicz traces.
- Automated Synthesis of Distributed Controllers
- MSO Logic for Unambiguous Shared-Memory Systems
- Asynchronous sliding block maps
- An extension of Kleene's and Ochmański's theorems to infinite traces
- A note on skew-asynchronous cellular automata
- COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS
- Fundamentals of Computation Theory
- Distributed Asynchronous Automata
- Asynchronous cellular automata for pomsets without auto-concurrency
- On the complementation of asynchronous cellular Büchi automata
- ON ASYNCHRONOUS CELLULAR AUTOMATA
- On Distributed Monitoring and Synthesis
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Asynchronous cellular automata for infinite traces
- UNAMBIGUOUS SHARED-MEMORY SYSTEMS
- Semantics of Deterministic Shared-Memory Systems
- Pattern matching in trace monoids
- Asynchronous sliding block maps
- Determinizing asynchronous automata
- Distributed automata in an assumption-commitment framework
Recommendations
This page was built for publication: Asynchronous mappings and asynchronous cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690237)