Network-conscious \(\pi\)-calculus -- a model of Pastry
DOI10.1016/j.entcs.2015.04.002zbMath1342.68236OpenAlexW1963833227WikidataQ113317812 ScholiaQ113317812MaRDI QIDQ530841
Matteo Sammartino, Ugo Montanari
Publication date: 1 August 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2015.04.002
verificationcoalgebrapresheafprocess calculusoverlay networkdistributed hash tablepeer-to-peer systemHD-automatonnetwork-conscious pi-calculusPastryrouting convergence
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)
Uses Software
Cites Work
- Unnamed Item
- A theory of system behaviour in the presence of node and link failure
- A calculus of communicating systems
- A calculus of mobile processes. II
- Universal coalgebra: A theory of systems
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
- Resource access control in systems of mobile agents
- A network-conscious \(\pi\)-calculus and its coalgebraic semantics
- Basic observables for a calculus for global computing
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
- Families of Symmetries as Efficient Models of Resource Binding
- A calculus for costed computations
- Network Conscious π-calculus: A Concurrent Semantics
- Counting the Cost in the Picalculus (Extended Abstract)
This page was built for publication: Network-conscious \(\pi\)-calculus -- a model of Pastry
