Towards a complete hierarchy of compositional dataflow models
From MaRDI portal
Recommendations
Cites work
- A fixpoint semantics for nondeterministic data flow
- A model and temporal proof system for networks of processes
- A Theory of Communicating Sequential Processes
- Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
- scientific article; zbMATH DE number 3837349 (Why is no real title available?)
- scientific article; zbMATH DE number 4213439 (Why is no real title available?)
- scientific article; zbMATH DE number 3808940 (Why is no real title available?)
- scientific article; zbMATH DE number 3901997 (Why is no real title available?)
- scientific article; zbMATH DE number 3943004 (Why is no real title available?)
- scientific article; zbMATH DE number 3947615 (Why is no real title available?)
- scientific article; zbMATH DE number 3956423 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4050970 (Why is no real title available?)
- scientific article; zbMATH DE number 4060692 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177823 (Why is no real title available?)
- scientific article; zbMATH DE number 3469994 (Why is no real title available?)
- scientific article; zbMATH DE number 3997145 (Why is no real title available?)
- scientific article; zbMATH DE number 4119609 (Why is no real title available?)
- Nondeterministic data flow programs: How to avoid the merge anomaly
- On the suitability of trace semantics for modular proofs of communicating processes
- Proofs of Networks of Processes
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable
- Specification-oriented semantics for communicating processes
- Testing equivalences for processes
- The expressive power of indeterminate dataflow primitives
Cited in
(3)
This page was built for publication: Towards a complete hierarchy of compositional dataflow models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096218)