A fixpoint semantics for nondeterministic data flow

DOI10.1145/3149.3155zbMath0629.68011OpenAlexW2028621470MaRDI QIDQ3766815

No author found.

Publication date: 1985

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3149.3155

zbMATH Keywords

nondeterminismasynchronous processesinput-output relationdata flow semanticsBrock-Ackerman anomaliesdenotationalpartially ordered multiset of input-output histories

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (10)

A fully abstract trace model for dataflow and asynchronous networks ⋮ Fairness, Resources, and Separation ⋮ A Petri nets semantics for data flow networks ⋮ Concurrent transition systems ⋮ Linear dynamic Kahn networks are deterministic ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ Specification and verification of concurrent systems by causality and realizability ⋮ Equational reasoning about nondeterministic processes ⋮ An extensional fixed-point semantics for nondeterministic data flow ⋮ The algebra of stream processing functions

This page was built for publication: A fixpoint semantics for nondeterministic data flow