Causal computational complexity of distributed processes

Demangeon, R. and Yoshida, N. (2023) Causal computational complexity of distributed processes. Information and Computation, 290, 104998. (doi: 10.1016/j.ic.2022.104998)

[img] Text
287452.pdf - Published Version
Available under License Creative Commons Attribution.

733kB

Abstract

This article 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 polytime computable 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 necessary syntactic flow analysis to typable processes to ensure a computational bound on the number of distributed messages. We prove that our analysis is decidable; 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, meaning that each polynomial recursive function can be computed by a typable process.

Item Type:Articles
Additional Information:We deeply thank the reviewers' detailed and helpful comments. The second author is supported by EPSRC EP/T006544/1, EP/K011715/1, EP/K034413/1, EP/L00058X/1, EP/N027833/1, EP/N028201/1, EP/T014709/1, EP/V000462/1, EP/X015955/1 and VeTSS.
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Yoshida, Professor Nobuko
Authors: Demangeon, R., and Yoshida, N.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Information and Computation
Publisher:Elsevier
ISSN:0890-5401
ISSN (Online):1090-2651
Published Online:01 December 2022
Copyright Holders:Copyright © 2022 The Authors
First Published:First published in Information and Computation 290: 104998
Publisher Policy:Reproduced under a Creative Commons License

University Staff: Request a correction | Enlighten Editors: Update this record