Causal computational complexity of distributed processes

DOI10.1145/3209108.3209122zbMATH Open1497.68333OpenAlexW2798462688MaRDI QIDQ5145308FDOQ5145308

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

Recommendations

• Types for complexity of parallel computation in pi-calculus
• Causality for mobile processes
• Timed, Distributed, Probabilistic, Typed Processes
• A fully abstract semantics for causality in the π-calculus
• Non-interleaving semantics for mobile processes

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)

Cited In (5)

• Concurrencies in reversible concurrent calculi
• Causal computational complexity of distributed processes
• The correctness of concurrencies in (reversible) concurrent calculi
• Types for complexity of parallel computation in pi-calculus
• Interval approximations of message causality in distributed executions

This page was built for publication: Causal computational complexity of distributed processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145308)