Causality for mobile processes

DOI10.1007/3-540-60084-1_113zbMath1412.68149OpenAlexW1532326694MaRDI QIDQ4645219

Pierpaolo Degano, Corrado Priami

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_113

zbMATH Keywords

partial ordertransitive closuretransition systemoperational semanticstructural dependency

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

Types for complexity of parallel computation in pi-calculus, Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators, Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS, A process algebra with distributed priorities, Names of the \(\pi\)-calculus agents handled locally, Causal computational complexity of distributed processes

Uses Software

• Facile

Cites Work

• Modal logics for mobile processes
• Priorities in process algebras
• An operational semantics of occam
• A partial ordering semantics for CCS
• Modeling concurrency with partial orders
• Petri nets, algebras, morphisms, and compositionality
• A calculus of mobile processes. II
• A theory of processes with localities
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
• A fully abstract semantics for causality in the π-calculus
• On relating some models for concurrency
• Read-write causality
• Proved trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item