scientific article
From MaRDI portal
Publication:3835040
zbMath0678.68077MaRDI QIDQ3835040
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Theory of operating systems (68N25)
Related Items
Asynchronous automata versus asynchronous cellular automata ⋮ Undecidability of partial order logics ⋮ Subclasses of recognizable trace languages ⋮ A quadratic construction for Zielonka automata with acyclic communication structure ⋮ Towards automata for branching time and partial order ⋮ Asynchronous cellular automata for pomsets without auto-concurrency ⋮ MSO Logic for Unambiguous Shared-Memory Systems ⋮ Semantics of Deterministic Shared-Memory Systems ⋮ Determinizing asynchronous automata ⋮ Logical definability on infinite traces ⋮ Compositional synthesis of asynchronous automata ⋮ Asynchronous cellular automata for infinite traces ⋮ Synthesis of Safe Message-Passing Systems ⋮ Asynchronous cellular automata for pomsets ⋮ Recognizable trace languages, distributed automata and the distribution problem
