Read-write causality

DOI10.1007/3-540-58338-6_103zbMath1493.68254OpenAlexW1762927468MaRDI QIDQ5096915

Daniel Yankelevich, Corrado Priami

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_103

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Causality for mobile processes ⋮ Non-interleaving semantics for mobile processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal axioms for bisimulations
• A partial ordering semantics for CCS
• Modeling concurrency with partial orders
• A calculus of mobile processes. II
• A theory of processes with localities
• Automatizing parametric reasoning on distributed concurrent systems
• Algebraic laws for nondeterminism and concurrency
• A parametric approach to localities
• Proved trees

This page was built for publication: Read-write causality