Deriving bisimulation congruences for reactive systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1877 LNCS, Issue , 2000, Pages 243-258

  Leifer, James J ^a   Milner, Robin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACTION CALCULUS; BISIMULATION CONGRUENCES; LABELLED TRANSITION SYSTEMS; PRECISE DEFINITION; REACTIVE SYSTEM; RELATIVE PUSHOUT; STRUCTURAL CONGRUENCES; TRANSITION RULE;

BIOMINERALIZATION;

EID: 84885204671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_19     Document Type: Conference Paper

References (24)

1. Ariola, Z. M. and Klop, J. W., Equational term graph rewriting. Fundamentae Informaticae, 26(3,4), pp. 207-240, 1996.
2. Abadi, M. and Gordon, A. D., A calculus for cryptographic protocols: the spi calculus. Proc. Fourth ACM Conf. on Computer and Communications Security, Zürich, ACM Press, pp. 36-47, 1997.
3. Baeten, J. C. and Weiland, W. P., Process algebra. CUP, 1990.
4. Berry, G. and Boudol, G., The chemical abstract machine. Theor. Comp. Sci. 96, pp. 217-248, 1992.
5. Cardelli, L. and Gordon, A. D., Mobile ambients. Foundations of System Specification and Computational Structures, LNCS 1378, pp. 140-155, 1998.
6. Corradini, A. and Montanari, U., An algebra of graphs and graph rewriting. Proc. Fourth Biennial Conf. on Category Theory and Computer Science, LNCS 530, pp. 236-260, 1991.
7. Fournet, C., Gonthier, G., Lévy, J.-J., Maranget, L., and Rémy, D., A calculus of mobile agents. Proc. CONCUR'96, LNCS 1119, pp. 406-421, 1996.
8. Gardner, P., Closed action calculi. Theor. Comp. Sci. 228(1,2), pp. 77-103, 1999.
9. van Glabbeek, R. J., The linear time - branching time spectrum. Proc. CON-CUR'90, LNCS 458, pp. 278-297, 1990.
10. Groote, J. F. and Vaandrager, F. W., Structural operational semantics and bisimulation as a congruence. Information and Computation 100(2), pp. 202-260, 1992.
11. Hasegawa, M. Models of sharing graphs (a categorical semantics of let and letrec). PhD thesis, LFCS, University of Edinburgh, 1997.
12. Hoare, C. A. R., Communicating Sequential Processes. Prentice Hall, 1985.
13. Jeffrey, A. and Rathke, J., Towards a theory of bisimulation for local names. Proc. LICS'99, IEEE Press, pp. 56-66, 1999.
14. Joyal, A., Nielsen, M. and Winskel, G., Bisimulation from open maps. Information and Computation 127(2), pp. 164-185, 1996.
15. Milner, R., Communication and Concurrency. Prentice Hall, 1989.
16. Milner, R., Functions as processes. Mathematical Structures in Computer Science 2(2), pp. 119-141, 1992.
17. Milner, R., Calculi for interaction. Acta Informatica 244, 245, 252 33(8), pp. 707-737, 1996.
18. Milner, R., Parrow, J. and Walker, D., A calculus of mobile processes, Parts 1 and 2. Information and Computation 100(1), pp. 1-77, 1992.
19. Milner, R. and Sangiorgi, D., Barbed bisimulation. Proc. ICALP'92, LNCS 623, pp. 685-695, 1992.
20. Pitts, A. M. and Stark, I. D. B., Observable properties of higher order functions that dynamically create local names, or: What's new? Proc. MFCS, LNCS 711, pp 122-141, 1993.
21. Park, D., Concurrency and automata on infinite sequences. LNCS 104, 1980.
22. Sewell, P., From rewrite rules to bisimulation congruences. Proc. CONCUR'98, LNCS 1466, pp. 269-284, 1998. [Revised version to appear in a special issue of Theor. Comp. Sci.]
23. Sewell, P., Global/local subtyping and capability inference for a distributed pi-calculus. Proc. ICALP'98, LNCS 1443, pp. 695-706, 1998.
24. Turi, D. and Plotkin, G. Towards a mathematical operational semantics. Proc. LICS'97, IEEE Press, pp. 280-291, 1997.