On the expressiveness of internal mobility in name-passing calculi
From MaRDI portal
Publication:1276243
DOI10.1016/S0304-3975(97)00220-XzbMath0915.68059MaRDI QIDQ1276243
Publication date: 20 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (30)
Tau laws for pi calculus ⋮ On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Linear forwarders ⋮ Types and full abstraction for polyadic \(\pi\)-calculus ⋮ Strong normalisation in the \(\pi\)-calculus ⋮ Bisimulation congruence of \(\chi\)-calculus ⋮ Separating Sessions Smoothly ⋮ Unnamed Item ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Variations on mobile processes ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ Linearity, Control Effects, and Behavioral Types ⋮ Linear logical relations and observational equivalences for session-based concurrency ⋮ Denotational semantics of channel mobility in UTP-CSP ⋮ The \(C_\pi\)-calculus: a model for confidential name passing ⋮ Responsiveness in process calculi ⋮ Linear logic propositions as session types ⋮ Full abstraction for expressiveness: history, myths and facts ⋮ On the expressive power of \textsc{Klaim}-based calculi ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators ⋮ Bisimulations in the join-calculus ⋮ Event structures for the reversible early internal \(\pi\)-calculus ⋮ An interpretation of typed objects into typed \(\pi\)-calculus ⋮ On transformations of concurrent-object programs ⋮ Unnamed Item ⋮ On modelling mobility ⋮ Communication and mobility control in boxed ambients ⋮ On an open problem of Amadio and Curien: The finite antichain condition ⋮ Matching Systems for Concurrent Calculi
Cites Work
- Unnamed Item
- Unnamed Item
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Locality and interleaving semantics in calculi for mobile processes
- Some congruence properties for \(\pi\)-calculus bisimilarities
- A fully abstract semantics for causality in the \(\pi\)-calculus
- On bisimulations for the asynchronous \(\pi\)-calculus
- An efficiency preorder for processes
- Testing equivalences for processes
- A \(\pi\)-calculus with explicit substitutions
- Asynchronous process calculi: The first- and higher-order paradigms
- Algebraic theories for name-passing calculi
- A theory of bisimulation for the \(\pi\)-calculus
- Functions as processes
- Decoding choice encodings
This page was built for publication: On the expressiveness of internal mobility in name-passing calculi