The Value-Passing Calculus

DOI10.1007/978-3-642-39698-4_11zbMath1390.68469OpenAlexW153780786MaRDI QIDQ2842635

Yuxi Fu

Publication date: 16 August 2013

Published in: Theories of Programming and Formal Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39698-4_11

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Theory of interaction ⋮ Extensional Petri net ⋮ Non-deterministic structures of computation ⋮ Unnamed Item ⋮ A thesis for interaction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• Communicating processes with value-passing and assignments
• On the expressiveness of interaction
• A proof system for communicating processes with value-passing
• A calculus of mobile processes. I
• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• A complete axiomatisation for observational congruence of finite-state behaviours
• A theory of communicating processes with value passing
• Plain CHOCS. A second generation calculus for higher order processes
• A theory of higher order communicating systems
• Proof systems for message-passing process algebras
• Algebraic theories for name-passing calculi
• Axiomatising divergence
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Communicating sequential processes
• Branching time and abstraction in bisimulation semantics
• Unique fixpoint induction for message-passing process calculi

This page was built for publication: The Value-Passing Calculus