Nondeterministic data flow programs: How to avoid the merge anomaly

DOI10.1016/0167-6423(88)90016-0zbMath0632.68016OpenAlexW2030755010MaRDI QIDQ1095640

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

zbMATH Keywords

fixed-point semanticsOperational semanticscomputation sequencesnondeterministic agentsprogramming language for the description of networkstree-like graphs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items

A fully abstract trace model for dataflow and asynchronous networks, A compositional dataflow semantics for Petri nets, An operator net model for distributed systems, Linear dynamic Kahn networks are deterministic, Towards a complete hierarchy of compositional dataflow models, Compositional relational semantics for indeterminate dataflow networks, Dataflow semantics for Petri nets, A functional programming approach to the specification and verification of concurrent systems, Network algebra for asynchronous dataflow^∗, The algebra of stream processing functions, Automated analysis of fault-tolerance in distributed systems