Deconstructing behavioural theories of mobility

IFIP International Federation for Information Processing

Volumn 273, Issue , 2008, Pages 507-520

  Rathke, Julian ^a   Sobociński, Paweł ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES;

HIGHER-ORDER; LABELLED TRANSITIONS; OPERATIONAL SEMANTICS; PROCESS STRUCTURES; REDUCTION RULES; STRUCTURAL APPROACH; STRUCTURAL OPERATIONAL SEMANTICS; TRANSITION SYSTEM;

COMPUTER SCIENCE;

EID: 48249158292     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-09680-3_34     Document Type: Conference Paper

References (22)

1. R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous picalculus. Theoretical Computer Science, 195(2):291-324, 1998.
2. M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In IEEE Symposium on Logic in Computer Science LiCS 1998.
3. G. Boudol. Asynchrony and the π-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1991.
4. R. Bruni and U. Montanari. Cartesian closed double categories, their lambda-notation, and the Pi-calculus. In IEEE Symposium on Logic in Computer Science LiCS, 1999.
5. L. Cardelli and A. Gordon. Mobile ambients. In Foundations of Software Science and Computation Structures, FoSSaCS, LNCS. Springer-Verlag, 1998.
6. U. Engberg and M. Nielsen. A calculus of communicating systems with label passing. Technical Report DAIMI PB-208, University of Aarhus, May 1986.
7. C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi. In International Colloquium on Automata, Languages and Programming ICALP, volume 1443 of LNCS. Springer-Verlag, 1998.
8. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In European Conference on Object-Oriented Programming ECOOP, 1991.
9. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437-486, 1995.
10. A.S.A. Jeffrey and J. Rathke. Contextual equivalence for higher-order pi-calculus revisited. Logical Methods in Computer Science, 1(1:4), 2005.
11. B. Klin, V. Sassone, and P. Sobociński. Labels from reductions: towards a general theory. In Conference on Algebra and Coalgebra in Computer Science Calco, volume 3629 of LNCS, pages 30-50. Springer, 2005.
12. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In International Conference on Concurrency Theory Concur, volume 1877 of LNCS, pages 243-258. Springer, 2000.
13. R. Milner. Communicating and Mobile Systems: The π-calculus. CUP, 1999.
14. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, II. Information and Computation, 100(1):41-77, 1992.
15. G. D. Plotkin. A structural approach to operational semantics. Technical Report FN-19, DAIMI, Computer Science Department, Aarhus University, 1981.
16. J. Rathke and P. Sobociński. Deriving structural labelled transitions for mobile ambients, 2008. Submitted for publication.
17. D. Sangiorgi. Bisimulation for higher-order process calculi. Information and Computation, 131(2):141-178, 1996.
18. D. Sangiorgi and D. Walker. The π-calculus. CUP, 2001.
19. D. Sangiorgi and D. Walker. Some results on barbed equivalences in pi-calculus. In International Conference on Concurrency Theory CONCUR volume 2154 of LNCS. Springer-Verlag, 2001.
20. V. Sassone and P. Sobociński. Locating reaction with 2-categories. Theoretical Computer Science, 333(1-2):297-327, 2005.
21. Peter Sewell. From rewrite rules to bisimulation congruences. Theoretical Computer Science, 274(1-2):183-230, 2002.
22. A. Ziegler, D. Miller, and C. Palamidessi. A congruence format for name-passing calculi. In Workshop on Structural Operational Semantics SOS, volume 156 of ENTCS, pages 169-189, 2006.