Causality for mobile processes

DOI10.1007/3-540-60084-1_113MaRDI QIDQ4645219zbMATH OpenOpenAlexFDO

Authors 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

operational semanticpartial orderstructural dependencytransition systemtransitive closure

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)

Recommendations

• Non-interleaving semantics for mobile processes
• A fully abstract semantics for causality in the π-calculus
• A fully abstract semantics for causality in the \(\pi\)-calculus
• scientific article; zbMATH DE number 1296290
• A calculus of mobile processes. I

Cites work

• A calculus of mobile processes. II
• A fully abstract semantics for causality in the π-calculus
• A partial ordering semantics for CCS
• A theory of processes with localities
• An operational semantics of occam
• scientific article; zbMATH DE number 3911691 (Why is no real title available?)
• scientific article; zbMATH DE number 4074504 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 177855 (Why is no real title available?)
• scientific article; zbMATH DE number 1333606 (Why is no real title available?)
• scientific article; zbMATH DE number 1479626 (Why is no real title available?)
• Modal logics for mobile processes
• Modeling concurrency with partial orders
• On relating some models for concurrency
• Petri nets, algebras, morphisms, and compositionality
• Priorities in process algebras
• Proved trees
• Read-write causality
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus

Cited in

(12)

• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
• A fully abstract semantics for causality in the \(\pi\)-calculus
• A process algebra with distributed priorities
• Non-interleaving semantics for mobile processes
• Names of the -calculus agents handled locally
• Causal computational complexity of distributed processes
• Types for complexity of parallel computation in pi-calculus
• A chart semantics for the pi-calculus
• scientific article; zbMATH DE number 1950546 (Why is no real title available?)
• Causal computational complexity of distributed processes
• Causality and replication in concurrent processes
• Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators

Describes a project that uses

Uses Software

• Facile

This page was built for publication: Causality for mobile processes

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