Flowgraphs and Flow Algebras

DOI10.1145/322154.322167MaRDI QIDQ3854604zbMATH OpenOpenAlexFDO

Authors Robin 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

communicating processesconcurrencyflow algebrasflow diagramsinitial algebraic semanticsnondeterminismparallelismprocess

Mathematics Subject Classification ID

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

Cited in

(15)

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

This page was built for publication: Flowgraphs and Flow Algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3854604)