The following pages link to (Q3795195):
Displayed 20 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Concurrent transition systems (Q1119395) (← links)
- An operator net model for distributed systems (Q1123601) (← links)
- The expressive power of indeterminate dataflow primitives (Q1201292) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- A proof of the Kahn principle for input/output automata (Q1822994) (← links)
- Fairness, Resources, and Separation (Q3178252) (← links)
- From Sequential Specifications to Eventual Consistency (Q3449480) (← links)
- From domains to automata with concurrency (Q4630301) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- Towards a complete hierarchy of compositional dataflow models (Q5096218) (← links)
- Compositional relational semantics for indeterminate dataflow networks (Q5096251) (← links)
- A generalized Kahn Principle for abstract asynchronous networks (Q5887509) (← links)
- Connections between a concrete and an abstract model of concurrent systems (Q5887511) (← links)
- A category-theoretic semantics for unbounded indeterminacy (Q5887523) (← links)
- The expressive power of delay operators in SCCS (Q5895328) (← links)
- The expressive power of delay operators in SCCS (Q5966211) (← links)