A theory of communicating processes with value passing

DOI10.1006/INCO.1993.1067zbMath0794.68098OpenAlexW2071435903MaRDI QIDQ1317426

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

Publication date: 24 March 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1993.1067

zbMATH Keywords

process algebrasproof systemcommunicating processes

Mathematics Subject Classification ID

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

Related Items (24)

Revisiting sequential composition in process calculi ⋮ A semantic theory for value-passing processes based on the late approach ⋮ A presheaf semantics of value-passing processes ⋮ Theory of interaction ⋮ Unnamed Item ⋮ A ground-complete axiomatization of stateless bisimilarity over Linda ⋮ Probabilistic bisimulations for quantum processes ⋮ Late and early semantics coincide for testing ⋮ Communicating processes with value-passing and assignments ⋮ Symbolic Bisimulation for Quantum Processes ⋮ Non-deterministic structures of computation ⋮ Divergence in testing and readiness semantics ⋮ Branching bisimulation semantics for quantum processes ⋮ Unnamed Item ⋮ Relational concurrent refinement. II: Internal operations and outputs ⋮ A thesis for interaction ⋮ Proof systems for message-passing process algebras ⋮ A conservative look at operational semantics with variable binding ⋮ A behavioural theory of first-order CML ⋮ Linda-based applicative and imperative process algebras ⋮ The Value-Passing Calculus ⋮ Consistently-detecting monitors ⋮ A fully abstract denotational semantics for the \(\pi\)-calculus ⋮ Additive models of probabilistic processes

This page was built for publication: A theory of communicating processes with value passing