Causal computational complexity of distributed processes

DOI10.1016/j.ic.2022.104998OpenAlexW4310493816MaRDI QIDQ2112798

Nobuko Yoshida, Romain Demangeon

Publication date: 12 January 2023

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2022.104998

zbMATH Keywords

complexityconcurrencyservicesprocess calculi

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of mobile processes. I
• A causal semantics for CCS via rewriting logic
• Soft linear logic and polynomial time
• Ensuring termination by typability
• Propositions as sessions
• Light logics and higher-order processes
• On session types and polynomial time
• Session Types as Intuitionistic Linear Propositions
• Termination in Impure Concurrent Languages
• Causality for mobile processes
• Type-Based Complexity Analysis for Fork Processes
• Causal Computational Complexity of Distributed Processes
• A Compositional Semantics for the Reversible p-Calculus
• Well-founded recursion with copatterns and sized types
• Perspectives of System Informatics

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