Fair ambients
From MaRDI portal
Publication:877172
DOI10.1007/S00236-007-0038-ZzbMath1111.68082OpenAlexW2912565202MaRDI QIDQ877172
Publication date: 19 April 2007
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-007-0038-z
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of software (68N99)
Related Items (6)
A pure labeled transition semantics for the applied pi calculus ⋮ Theory of interaction ⋮ Parameterizing higher-order processes on names and processes ⋮ Deriving structural labelled transitions for mobile ambients ⋮ On the expressiveness of interaction ⋮ Applying a testing approach to the Calculus of Fair Ambients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On quasi-open bisimulation
- Bisimulation for higher-order process calculi
- The lambda calculus. Its syntax and semantics. Rev. ed.
- A calculus of mobile processes. I
- The lazy lambda calculus in a concurrency scenario
- Bisimulation congruence of \(\chi\)-calculus
- Mobile ambients
- Typing evolving ambients
- On the computational strength of pure ambient calculi
- On the expressive power of movement and restriction in pure mobile ambients
- BioAmbients: an abstraction for biological compartments
- Tau laws for pi calculus
- A theory of bisimulation for the \(\pi\)-calculus
- Variations on mobile processes
- Functions as processes
- Equational properties of mobile ambients
- On the Expressiveness of Pure Mobile Ambients
- Controlling interference in ambients
- Anytime, anywhere
- Bisimulation congruences in safe ambients
- Foundations of Software Science and Computation Structures
- Brane Calculi
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
This page was built for publication: Fair ambients
