Causal computational complexity of distributed processes

DOI10.1145/3209108.3209122MaRDI QIDQ5145308zbMATH OpenOpenAlexFDO

Authors Romain Demangeon, Nobuko Yoshida

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)

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

Cited in

(5)

• Types for complexity of parallel computation in pi-calculus
• The correctness of concurrencies in (reversible) concurrent calculi
• Concurrencies in reversible concurrent calculi
• Causal computational complexity of distributed processes
• 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)