Non-interleaving semantics for mobile processes

DOI10.1016/S0304-3975(99)80003-6zbMath0914.68128MaRDI QIDQ1285660

Pierpaolo Degano, Corrado Priami

Publication date: 28 April 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

operational semantics; mobile computing; true concurrency

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

Related Items

Models for name-passing processes: Interleaving and causal, Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS, Primitives for authentication in process algebras., A causal semantics for CCS via rewriting logic, Language-based performance prediction for distributed and mobile systems, Modelling biochemical pathways through enhanced \(\pi\)-calculus

Uses Software

• Facile

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Locality and interleaving semantics in calculi for mobile processes
• Modal logics for mobile processes
• Observing localities
• A partial ordering semantics for CCS
• Modeling concurrency with partial orders
• Petri nets, algebras, morphisms, and compositionality
• A distributed operational semantics of CCS based on condition/event systems
• A fully abstract semantics for causality in the \(\pi\)-calculus
• A calculus of mobile processes. II
• Plain CHOCS. A second generation calculus for higher order processes
• Comparing locality and causality based equivalences
• Asynchronous process calculi: The first- and higher-order paradigms
• Causality and true concurrency: A data-flow analysis of the Pi-Calculus
• Read-write causality
• Proved trees
• A calculus of mobile agents