Asynchronous cellular automata for pomsets
type: Item
instance of: scholarly article
title: Asynchronous cellular automata for pomsets
zbMATH Open document ID: 0949.68086
DOI: 10.1016/S0304-3975(00)00166-3
published in: Theoretical Computer Science
publication date: 2000-10-26T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1521726
zbMATH Keywords: Automata theory
zbMATH Keywords: monadic second-order logic
zbMATH Keywords: concurrency
zbMATH Keywords: partial orders
author: Manfred Droste
author: Paul Gastin
author: Dietrich Kuske
MaRDI profile type: Publication
cites work: An extension of the notions of traces and of asynchronous automata
cites work: Asynchronous mappings and asynchronous cellular automata
cites work: Asynchronous cellular automata for pomsets without auto-concurrency
cites work: A partial trace semantics for Petri nets
cites work: Q4079524
cites work: The equational theory of pomsets
cites work: Q4251923
cites work: Q4247275
cites work: Q4381401
cites work: Series-parallel languages and the bounded-width property
cites work: Modeling concurrency with partial orders
cites work: Q4741710
cites work: Notes on finite asynchronous automata
cites work: Q3835040
Recommended article: Q4251923
Recommended article: Asynchronous cellular automata for pomsets without auto-concurrency
Recommended article: ON ASYNCHRONOUS CELLULAR AUTOMATA
Recommended article: Asynchronous mappings and asynchronous cellular automata
Recommended article: Computational Aspects of Asynchronous Cellular Automata
Recommended article: Fundamentals of Computation Theory
Recommended article: Asynchronous cellular automata and dynamical properties
Recommended article: Some Formal Properties of Asynchronous Cellular Automata
Recommended article: Asynchronous cellular automata for infinite traces
description: scientific article; zbMATH DE number 1521726