Typed ψ-calculi

DOI10.1007/978-3-642-23217-6_18zbMath1344.68166OpenAlexW86813616MaRDI QIDQ3090835

Hans Hüttel

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_18

Mathematics Subject Classification ID

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

Related Items (5)

Declarative event based models of concurrency and refinement in psi-calculi ⋮ Binary Session Types for Psi-Calculi ⋮ Name-passing calculi: from fusions to preorders and types ⋮ Unnamed Item ⋮ A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mobile ambients
• Trust and partial typing in open systems of mobile agents
• Secrecy types for asymmetric communication.
• A generic type system for the pi-calculus
• The name discipline of uniform receptiveness
• Ensuring termination by typability
• Explicit fusions
• Psi-calculi: a framework for mobile processes with nominal data and logic
• Secrecy by typing in security protocols
• A Hybrid Type System for Lock-Freedom of Mobile Processes
• The Space and Motion of Communicating Agents
• Nominal (Universal) Algebra: Equational Logic with Names and Binding
• Programming Languages and Systems

This page was built for publication: Typed ψ-calculi