Pages that link to "Item:Q1333374"
From MaRDI portal
The following pages link to A fully abstract trace model for dataflow and asynchronous networks (Q1333374):
Displaying 8 items.
- Equational reasoning about nondeterministic processes (Q911801) (← links)
- The expressive power of indeterminate dataflow primitives (Q1201292) (← links)
- A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- On schematological equivalence of partially interpreted dataflow networks (Q1373139) (← links)
- Strong fairness and full abstraction for communicating processes (Q1854396) (← links)
- Infinite trace equivalence (Q2474445) (← links)
- Specification and verification of concurrent systems by causality and realizability (Q6049931) (← links)
