On Hierarchical Communication Topologies in the $$\pi $$ -calculus

DOI10.1007/978-3-662-49498-1_7zbMath1335.68166arXiv1601.01725OpenAlexW2228235215MaRDI QIDQ2802475

C.-H. Luke Ong, Emanuele D'Osualdo

Publication date: 26 April 2016

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.01725

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Liveness in broadcast networks

Uses Software

• Petruchio

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of structural stationarity in the \(\pi\)-calculus
• A calculus of mobile processes. I
• Ensuring termination by typability
• A Theory of Name Boundedness
• Ideal Abstractions for Well-Structured Transition Systems
• The Decidability of the Reachability Problem for CCS!
• On the Relationship between π-Calculus and Finite Place/Transition Petri Nets
• Bounds on Mobility
• Forward Analysis of Depth-Bounded Processes
• Functions as processes
• Behavioral equivalence in the polymorphic pi-calculus
• Well-structured transition systems everywhere!

This page was built for publication: On Hierarchical Communication Topologies in the $$\pi $$ -calculus