Flowgraphs and Flow Algebras

DOI10.1145/322154.322167zbMath0421.68025OpenAlexW2024074683MaRDI QIDQ3854604

Arthur J. Milner

Publication date: 1979

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

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

zbMATH Keywords

parallelismconcurrencynondeterminismprocessflow diagramscommunicating processesflow algebrasinitial algebraic semantics

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items (15)

A theory of processes with localities ⋮ Higher-level synchronising devices in Meije-SCCS ⋮ Algebraic calculi of processes and net expressions ⋮ About fair asynchrony ⋮ Processes with multiple entries and exits ⋮ Algebras for Tree Decomposable Graphs ⋮ Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable ⋮ A multiset semantics for the pi-calculus with replication ⋮ CCS with Hennessy's merge has no finite-equational axiomatization ⋮ Infinite trees in normal form and recursive equations having a unique solution ⋮ Structural inclusion in the pi-calculus with replication ⋮ A brief history of process algebra ⋮ Toward an algebraic theory of systems ⋮ Multisets and structural congruence of the pi-calculus with replication ⋮ A language for linking modules into systems

This page was built for publication: Flowgraphs and Flow Algebras