Towards a complete hierarchy of compositional dataflow models

DOI10.1007/3-540-54415-1_47zbMath1493.68248OpenAlexW1934405995MaRDI QIDQ5096218

Joost N. Kok, Bengt Jonsson

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/17970

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Linear dynamic Kahn networks are deterministic, The algebra of stream processing functions

Cites Work

• On the suitability of trace semantics for modular proofs of communicating processes
• Specification-oriented semantics for communicating processes
• A model and temporal proof system for networks of processes
• Nondeterministic data flow programs: How to avoid the merge anomaly
• Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable
• Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
• The expressive power of indeterminate dataflow primitives
• Testing equivalences for processes
• A Theory of Communicating Sequential Processes
• A fixpoint semantics for nondeterministic data flow
• Proofs of Networks of Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item