Asynchronous cellular automata for pomsets

DOI10.1016/S0304-3975(00)00166-3zbMath0949.68086MaRDI QIDQ1583242

Dietrich Kuske, Paul Gastin, Manfred Droste

Publication date: 26 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

monadic second-order logicconcurrencypartial ordersAutomata theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Regular sets of infinite message sequence charts ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ MSO Logic for Unambiguous Shared-Memory Systems ⋮ Semantics of Deterministic Shared-Memory Systems ⋮ Shared-Memory Systems and Charts ⋮ Muller message-passing automata and logics ⋮ UNAMBIGUOUS SHARED-MEMORY SYSTEMS ⋮ Pomset Languages of Finite Step Transition Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronous mappings and asynchronous cellular automata
• Modeling concurrency with partial orders
• The equational theory of pomsets
• A partial trace semantics for Petri nets
• Series-parallel languages and the bounded-width property
• Notes on finite asynchronous automata
• An extension of the notions of traces and of asynchronous automata
• Asynchronous cellular automata for pomsets without auto-concurrency

This page was built for publication: Asynchronous cellular automata for pomsets