Causal Computational Complexity of Distributed Processes

DOI10.1145/3209108.3209122zbMath1497.68333OpenAlexW2798462688MaRDI QIDQ5145308

Nobuko Yoshida, Romain Demangeon

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3209108.3209122

zbMATH Keywords

computational complexitytype systemflow analysiscausal dependencyconcurrent process calculi

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

The correctness of concurrencies in (reversible) concurrent calculi ⋮ Types for complexity of parallel computation in pi-calculus ⋮ Concurrencies in reversible concurrent calculi ⋮ Causal computational complexity of distributed processes

This page was built for publication: Causal Computational Complexity of Distributed Processes