Applying a testing approach to the calculus of fair ambients

DOI10.1080/00207160903243148zbMATH Open1187.68325OpenAlexW2057614962MaRDI QIDQ5850754FDOQ5850754

Authors: Xiaojuan Cai, Han Zhu 

Publication date: 15 January 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903243148

Recommendations

• Fair ambients
• Testing equivalence for mobile processes
• Explicit fairness in testing semantics
• Fair \(\pi\)
• Publication:4942011

zbMATH Keywords

process calculustesting equivalenceconcurrency theorytheoretical computer sciencefair ambients

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• A calculus of mobile processes. I
• Testing equivalences for processes
• Mobile ambients
• Deriving Structural Labelled Transitions for Mobile Ambients
• Anytime, anywhere: modal logics for mobile ambients
• Testing equivalence for mobile processes
• Title not available (Why is that?)
• On quasi-open bisimulation
• Bisimulation congruences in safe ambients
• Fair ambients
• Equational properties of mobile ambients
• Title not available (Why is that?)
• Controlling interference in ambients
• Typing evolving ambients
• Testing congruence for mobile processes

Cited In (3)

• Stubborn Sets, Frozen Actions, and Fair Testing
• Testing equivalence for mobile processes
• Explicit fairness in testing semantics

This page was built for publication: Applying a testing approach to the calculus of fair ambients

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