Communicating processes with value-passing and assignments

DOI10.1007/BF01212486zbMath0784.68055OpenAlexW1966449987MaRDI QIDQ688827

Matthew C. B. Hennessy, Anna Ingólfsdóttir

Publication date: 6 December 1993

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01212486

zbMATH Keywords

testingOccamcommunicating processesacceptance treesinequationsvalue-passing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (7)

Theory of interaction ⋮ Unnamed Item ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Late and early semantics coincide for testing ⋮ Bisimulations for a calculus of broadcasting systems ⋮ A behavioural theory of first-order CML ⋮ The Value-Passing Calculus

Cites Work

• A linear-history semantics for languages for distributed programming
• A calculus of communicating systems
• A proof system for communicating processes with value-passing
• A theory of communicating processes with value passing
• The laws of Occam programming
• A Theory of Communicating Sequential Processes
• Acceptance trees
• The Category-Theoretic Solution of Recursive Domain Equations
• Communicating sequential processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Communicating processes with value-passing and assignments