Causal Computational Complexity of Distributed Processes - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Causal Computational Complexity of Distributed Processes


This paper studies the complexity of π-calculus processes with respect to the quantity of transitions caused by an incoming message. First we propose a typing system for integrating Bellantoni and Cook's characterisation of polynomially-bound recursive functions into Deng and Sangiorgi's typing system for termination. We then define computational complexity of distributed messages based on Degano and Priami's causal semantics, which identifies the dependency between interleaved transitions. Next we apply a syntactic flow analysis to typable processes to ensure the computational bound of distributed messages. We prove that our analysis is decidable for a given process; sound in the sense that it guarantees that the total number of messages causally dependent of an input request received from the outside is bounded by a polynomial of the content of this request; and complete which means that each polynomial recursive function can be computed by a typable process.
Fichier principal
Vignette du fichier
main.pdf (677.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02074534 , version 1 (20-03-2019)



Romain Demangeon, Nobuko Yoshida. Causal Computational Complexity of Distributed Processes. LICS '18 - 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.344-353, ⟨10.1145/3209108.3209122⟩. ⟨hal-02074534⟩
47 View
80 Download



Gmail Facebook X LinkedIn More