Representation of computations in concurrent automata by dependence orders
type: Item
instance of: scholarly article
title: Representation of computations in concurrent automata by dependence orders
zbMATH Open document ID: 0902.68126
DOI: 10.1016/S0304-3975(96)00012-6
author: Felipe Bracho
author: Manfred Droste
author: Dietrich Kuske
published in: Theoretical Computer Science
publication date: 1998-10-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1213157
zbMATH Keywords: finite computation sequences
MaRDI profile type: Publication
cites work: Theory of traces
cites work: Q4160405
cites work: Minimal and Optimal Computations of Recursive Programs
cites work: Q5331549
cites work: Q3805920
cites work: From domains to automata with concurrency
cites work: Labelled domains and automata with concurrency
cites work: Dependence orders for computations of concurrent automata
cites work: Q4692885
cites work: Combinatorics on traces
cites work: Q4038692
cites work: CONCURRENT AUTOMATA AND DOMAINS
cites work: Recognizable languages in concurrency monoids
cites work: Aperiodic languages in concurrency monoids
cites work: Recognizable languages in divisibility monoids
cites work: Q5485973
cites work: Q4288284
cites work: Logical definability on infinite traces
cites work: The equational theory of pomsets
cites work: Q4165427
cites work: Q4035659
cites work: Star-free trace languages
cites work: Communicating sequential processes
cites work: Defining conditional independence using collapses
cites work: Q4867292
cites work: Q4954451
cites work: Q3771629
cites work: Q4733400
cites work: A calculus of communicating systems
cites work: Elementary transition systems
cites work: Q4038701
cites work: Q3795195
cites work: Q3670575
cites work: Connections between a concrete and an abstract model of concurrent systems
cites work: Compositional relational semantics for indeterminate dataflow networks
cites work: Q3030239
cites work: Models for concurrency: Towards a classification
cites work: Notes on finite asynchronous automata
description: scientific article; zbMATH DE number 1213157