On the expressiveness of internal mobility in name-passing calculi
From MaRDI portal
Publication:1276243
DOI10.1016/S0304-3975(97)00220-XzbMATH Open0915.68059MaRDI QIDQ1276243FDOQ1276243
Authors: Michele Boreale 
Publication date: 20 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- On the expressiveness of internal mobility in name-passing calculi
- On the relative expressive power of calculi for mobility
- Algebraic theories for name-passing calculi
- Foundations of Software Science and Computation Structures
- scientific article; zbMATH DE number 2087427
- scientific article; zbMATH DE number 1223739
- On asynchrony in name-passing calculi
- Name-passing calculi: from fusions to preorders and types
- Name-passing calculi: from fusions to preorders and types
- Name-passing in an ambient-like calculus and its proof using spatial logic
Cites Work
- A fully abstract semantics for causality in the \(\pi\)-calculus
- Functions as processes
- Title not available (Why is that?)
- Testing equivalences for processes
- Title not available (Why is that?)
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Some congruence properties for \(\pi\)-calculus bisimilarities
- A theory of bisimulation for the \(\pi\)-calculus
- Decoding choice encodings
- On bisimulations for the asynchronous \(\pi\)-calculus
- Algebraic theories for name-passing calculi
- An efficiency preorder for processes
- Asynchronous process calculi: The first- and higher-order paradigms
- Locality and interleaving semantics in calculi for mobile processes
- A \(\pi\)-calculus with explicit substitutions
Cited In (36)
- On modelling mobility
- Event structures for the reversible early internal \(\pi\)-calculus
- Full abstraction for expressiveness: history, myths and facts
- Taking linear logic apart
- The \(C_\pi\)-calculus: a model for confidential name passing
- Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
- Linear logic propositions as session types
- Communication and mobility control in boxed ambients
- On the expressive power of \textsc{Klaim}-based calculi
- Internal mobility and agent-passing calculi
- Towards a unified approach to encodability and separation results for process calculi
- On transformations of concurrent-object programs
- An interpretation of typed objects into typed \(\pi\)-calculus
- On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus
- Denotational semantics of channel mobility in UTP-CSP
- On the interactive power of higher-order processes extended with parameterization
- On an open problem of Amadio and Curien: The finite antichain condition
- Linearity, control effects, and behavioral types
- Bisimulations in the join-calculus
- A truly concurrent game model of the asynchronous \(\pi\)-calculus
- Linear forwarders
- Types and full abstraction for polyadic \(\pi\)-calculus
- Tau laws for pi calculus
- Asynchronous session-based concurrency: deadlock-freedom in cyclic process networks
- Deadlock freedom for asynchronous and cyclic process networks
- Linear logical relations and observational equivalences for session-based concurrency
- Strong normalisation in the \(\pi\)-calculus
- On the expressiveness of internal mobility in name-passing calculi
- Matching systems for concurrent calculi
- Comparing session type systems derived from linear logic
- Responsiveness in process calculi
- Bisimulation congruence of \(\chi\)-calculus
- Towards races in linear logic
- A subexponential view of domains in session types
- Variations on mobile processes
- Separating Sessions Smoothly
This page was built for publication: On the expressiveness of internal mobility in name-passing calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276243)
