Representation of computations in concurrent automata by dependence orders
From MaRDI portal
Publication:1269906
DOI10.1016/S0304-3975(96)00012-6zbMath0902.68126MaRDI QIDQ1269906
Felipe Bracho, Dietrich Kuske, Manfred Droste
Publication date: 22 October 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (6)
MSO Logic for Unambiguous Shared-Memory Systems ⋮ Topology for Computations of Concurrent Automata ⋮ Shared-Memory Systems and Charts ⋮ Synthesis of Safe Message-Passing Systems ⋮ Synchronization expressions with extended join operation ⋮ RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models for concurrency: Towards a classification
- Recognizable languages in concurrency monoids
- Theory of traces
- The equational theory of pomsets
- A calculus of communicating systems
- Combinatorics on traces
- Elementary transition systems
- Star-free trace languages
- Defining conditional independence using collapses
- Labelled domains and automata with concurrency
- Aperiodic languages in concurrency monoids
- Notes on finite asynchronous automata
- CONCURRENT AUTOMATA AND DOMAINS
- Communicating sequential processes
- Minimal and Optimal Computations of Recursive Programs
- Recognizable languages in divisibility monoids
- Dependence orders for computations of concurrent automata
- Logical definability on infinite traces
- From domains to automata with concurrency
- Compositional relational semantics for indeterminate dataflow networks
- Connections between a concrete and an abstract model of concurrent systems
This page was built for publication: Representation of computations in concurrent automata by dependence orders
