Nondeterministic data flow programs: How to avoid the merge anomaly
DOI10.1016/0167-6423(88)90016-0zbMATH Open0632.68016OpenAlexW2030755010MaRDI QIDQ1095640FDOQ1095640
Authors: Manfred Broy 
Publication date: 1988
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6423(88)90016-0
Recommendations
- A fixpoint semantics for nondeterministic data flow
- Semantics of finite and infinite networks of concurrent communicating agents
- Non-interleaving Semantics with Causality for Nondeterministic Dataflow
- scientific article; zbMATH DE number 3943004
- An extensional fixed-point semantics for nondeterministic data flow
fixed-point semanticsOperational semanticscomputation sequencesnondeterministic agentsprogramming language for the description of networkstree-like graphs
General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (13)
- Network algebra for asynchronous dataflow∗
- Dataflow semantics for Petri nets
- Towards a complete hierarchy of compositional dataflow models
- An operator net model for distributed systems
- A fixpoint semantics for nondeterministic data flow
- Linear dynamic Kahn networks are deterministic
- A compositional dataflow semantics for Petri nets
- The algebra of stream processing functions
- Semantics of finite and infinite networks of concurrent communicating agents
- A fully abstract trace model for dataflow and asynchronous networks
- Compositional relational semantics for indeterminate dataflow networks
- A functional programming approach to the specification and verification of concurrent systems
- Automated analysis of fault-tolerance in distributed systems
This page was built for publication: Nondeterministic data flow programs: How to avoid the merge anomaly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095640)
