Top-down design and the algebra of communicating processes

DOI10.1016/0167-6423(85)90010-3zbMath0606.68021OpenAlexW2021173961WikidataQ114851998 ScholiaQ114851998MaRDI QIDQ1084850

J. V. Tucker, Jan A. Bergstra

Publication date: 1985

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/12833

zbMATH Keywords

equational specificationalgebraic theory for the top-down design of communicating systemscommunicatio protocolstepwise refinements

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (8)

On sequential composition, action prefixes and process prefix ⋮ On the consistency of Koomen's fair abstraction rule ⋮ Global renaming operators in concrete process algebra ⋮ Algebraic specification of concurrent systems ⋮ Algebraic and functional specification of an interactive serializable database interface ⋮ Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination ⋮ Non-regular iterators in process algebra ⋮ Algebra of communicating processes with abstraction

This page was built for publication: Top-down design and the algebra of communicating processes