Matching Systems for Concurrent Calculi

DOI10.1016/j.entcs.2007.11.004zbMath1277.68189OpenAlexW2162905001MaRDI QIDQ2864374

Bjørn Haagensen, Sergio Maffeis, Iain Phillips

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.11.004

zbMATH Keywords

pi-calculusCCSmobile ambientsmatching systems

Mathematics Subject Classification ID

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

Related Items (5)

On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Expressiveness of concurrent intensionality ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Towards a Unified Approach to Encodability and Separation Results for Process Calculi ⋮ Full abstraction for expressiveness: history, myths and facts

Cites Work

• Unnamed Item
• Unnamed Item
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• On the expressiveness of internal mobility in name-passing calculi
• Testing equivalences for processes
• Mobile ambients
• Leader election in rings of ambient processes
• On asynchrony in name-passing calculi
• Foundations of Software Science and Computation Structures

This page was built for publication: Matching Systems for Concurrent Calculi