The following pages link to Concurrent transition systems (Q1119395):
Displayed 12 items.
- Models for concurrency: Towards a classification (Q672053) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- The expressive power of indeterminate dataflow primitives (Q1201292) (← links)
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- Relating conflict-free stable transition and event models via redex families (Q1608893) (← links)
- On the expressiveness of higher dimensional automata (Q2491631) (← links)
- Algebraic topology and concurrency (Q2500494) (← links)
- The conflict-free reduction geometry (Q2581368) (← links)
- Models and logics for true concurrency. (Q5955751) (← links)