The following pages link to (Q4723281):
Displaying 19 items.
- Concurrent transition systems (Q1119395) (← links)
- Clocks in dataflow languages (Q1185019) (← links)
- The expressive power of indeterminate dataflow primitives (Q1201292) (← links)
- A fully abstract trace model for dataflow and asynchronous networks (Q1333374) (← links)
- On schematological equivalence of partially interpreted dataflow networks (Q1373139) (← links)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
- A proof of the Kahn principle for input/output automata (Q1822994) (← links)
- Semantics of multiway dataflow constraint systems (Q2043794) (← links)
- (Q3400625) (← links)
- (Q3814772) (← links)
- (Q3975156) (← links)
- (Q4251928) (← links)
- (Q4282582) (← links)
- (Q4327835) (← links)
- Integrating TwoTowers and GreatSPN through a compact net semantics (Q4788445) (← links)
- Semantic Foundations for Deterministic Dataflow and Stream Processing (Q5041103) (← links)
- Towards a complete hierarchy of compositional dataflow models (Q5096218) (← links)
- The algebra of stream processing functions (Q5941194) (← links)
- Specification and verification of concurrent systems by causality and realizability (Q6049931) (← links)