Representation of computations in concurrent automata by dependence orders
From MaRDI portal
Publication:1269906
Recommendations
Cites work
- A calculus of communicating systems
- Aperiodic languages in concurrency monoids
- Combinatorics on traces
- Communicating sequential processes
- Compositional relational semantics for indeterminate dataflow networks
- CONCURRENT AUTOMATA AND DOMAINS
- Connections between a concrete and an abstract model of concurrent systems
- Defining conditional independence using collapses
- Dependence orders for computations of concurrent automata
- Elementary transition systems
- From domains to automata with concurrency
- scientific article; zbMATH DE number 4018370 (Why is no real title available?)
- scientific article; zbMATH DE number 3825182 (Why is no real title available?)
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- scientific article; zbMATH DE number 4060692 (Why is no real title available?)
- scientific article; zbMATH DE number 4074504 (Why is no real title available?)
- scientific article; zbMATH DE number 176495 (Why is no real title available?)
- scientific article; zbMATH DE number 177814 (Why is no real title available?)
- scientific article; zbMATH DE number 177823 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 554482 (Why is no real title available?)
- scientific article; zbMATH DE number 194916 (Why is no real title available?)
- scientific article; zbMATH DE number 4119618 (Why is no real title available?)
- scientific article; zbMATH DE number 849039 (Why is no real title available?)
- scientific article; zbMATH DE number 1456962 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- Labelled domains and automata with concurrency
- Logical definability on infinite traces
- Minimal and Optimal Computations of Recursive Programs
- Models for concurrency: Towards a classification
- Notes on finite asynchronous automata
- Recognizable languages in concurrency monoids
- Recognizable languages in divisibility monoids
- Star-free trace languages
- The equational theory of pomsets
- Theory of traces
- Trace languages definable with modular quantifiers
Cited in
(13)- Synchronization expressions with extended join operation
- Labelled domains and automata with concurrency
- Exposing latent mutual exclusion by work automata
- Shared-memory systems and charts
- MSO Logic for Unambiguous Shared-Memory Systems
- scientific article; zbMATH DE number 4026815 (Why is no real title available?)
- CONCURRENT AUTOMATA AND DOMAINS
- Topology for Computations of Concurrent Automata
- Dependence orders for computations of concurrent automata
- From domains to automata with concurrency
- Recognizable and logically definable languages of infinite computations in concurrent automata
- Synthesis of Safe Message-Passing Systems
- Recognizable languages in concurrency monoids
This page was built for publication: Representation of computations in concurrent automata by dependence orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269906)
