Models for name-passing processes: Interleaving and causal

Information and Computation

Volumn 190, Issue 2, 2004, Pages 136-178

  Cattani, Gian Luca ^a   Sewell, Peter ^b  

^a DS Data Systems SpA   (Italy)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Categorical models; Concurrency and distributed computation; Semantics; calculus

Indexed keywords

AUTOMATA THEORY; COMPUTATION THEORY; COMPUTER SIMULATION; DISTRIBUTED PARAMETER CONTROL SYSTEMS; MATHEMATICAL MODELS; SEMANTICS;

CATEGORIAL MODELS; CONCURRENCY AND DISTRIBUTED COMPUTATION; Π CALCULUS;

CONCURRENCY CONTROL;

EID: 2342473949     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2003.12.003     Document Type: Article

References (60)

1. M. Abadi, C. Fournet, Mobile values, new names, and secure communication, in: Proceedings of POPL 2001, 2001, pp. 104-115.
2. M. Abadi, A.D. Gordon, A calculus for cryptographic protocols: the spi calculus, in: Proceedings of the Fourth ACM Conference on Computer and Communications Security, ACM Press, Zürich, 1997, pp. 36-47.
3. M. Bednarczyk, Categories of asynchronous systems, PhD thesis, University of Sussex, 1988.
4. M. Boreale, R. De Nicola, Testing equivalences for mobile processes, Information and Computation 120 (1995) 279-303.
5. M. Boreale, R. De Nicola, A symbolic semantics for the π-calculus, Information and Computation 126 (1) (1996) 34-52.
6. M. Boreale, D. Sangiorgi, A fully abstract semantics for causality in the π-calculus, Acta Informatica 35 (1998) 353-400.
7. G. Boudol, Asynchrony and the π-calculus, Technical Report 1702, INRIA, Sophia Antipolis, 1992.
8. G. Boudol, I. Castellani, Permutation of transitions: an event structure semantics for CCS and SCCS, in: Proceedings of REX School/Workshop, volume 354 of Lecture Notes in Computer Science, 1988, pp. 411-427.
9. N. Busi, R. Gorrieri, A petri net semantics for π-calculus, in: I. Lee, S.A. Smolk (Eds.), Proceedings of the 6th International Conference on Concurrency Theory, CONCUR'95, volume 962 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995, pp. 145-159.
10. G.L. Cattani, Presheaf models for concurrency, PhD thesis, University of Aarhus, 1999.
11. G.L. Cattani, P. Sewell, Models for name-passing processes: interleaving and causal, Technical Report 505, Computer Laboratory, University of Cambridge, 2000.
12. G.L. Cattani, P. Sewell, Models for name-passing processes: interleaving and causal (extended abstract), in: LICS 2000, Proceedings of the Fifteenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 2000, pp. 322-333.
13. G.L. Cattani, I. Stark, G. Winskel, Presheaf models for the π-calculus. in: Proceedings of the 7th International Conference on Category Theory and Computer Science, CTCS '97, number 1290 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1997, pp. 106-126.
14. G.L. Cattani, G. Winskel, Presheaf models for Concurrency, in: D. van Dalen, M. Bezem (Eds.), Computer Science Logic, 10th International Workshop, CSL '96, Annual Conference of the European Association for Computer Science Logic, Selected Papers, volume 1258 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1997, pp. 58-75.
15. G.L. Cattani, G. Winskel, Presheaf models for CCS-like languages, Theoretical Computer Science 300 (2003) 47-89.
16. P. Darondeau, P. Degano, Causal trees, in: G. Ausiello, M. Dezani-Ciancaglini, S.R.D. Rocca (Eds.), ICALP '89, Sixteenth Colloquium on Automata, Languages and Programming, volume 372 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1989, pp. 234-248.
17. P. Degano, R. De Nicola, U. Montanari, On the consistency of "truly concurrent" operational and denotational semantics (extended abstract), in: LICS'88, Proceedings of the Third Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1988, pp. 133-141.
18. P. Degano, R. De Nicola, U. Montanari, Partial orderings descriptions and observations of nondeterministic concurrent processes, in: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, number 354 in Lecture Notes in Computer Science, 1988, pp. 438-496.
19. P. Degano, C. Priami, Non-interleaving semantics for mobile processes, Theoretical Computer Science 216 (1-2) (1999) 237-270.
20. M. Fiore, G.L. Cattani, G. Winskel, Weak bisimulation and open maps (extended abstract), in: LICS '99 [37], pp. 67-76.
21. M. Fiore, E. Moggi, D. Sangiorgi, A fully-abstract model for the π-calculus (extended abstract), in: LICS '99 [36], pp. 43-54.
22. M.P. Fiore, G.D. Plotkin, D. Turi, Abstract syntax and variable binding, in: LICS '99 [37], pp. 193-202.
23. M.P. Fiore, D. Turi, Semantics of name and value passing, in: Proceedings of the 16th Logic in Computer Science Conference (LICS'01), IEEE, Computer Society Press, 2001, pp. 93-104.
24. M. Gabbay, A. Pitts, A new approach to abstract syntax involving binders, in: LICS "99 [37], pp. 214-224.
25. R.V. Glabbeek, U. Goltz, Equivalence notions for concurrent systems and refinement of actions, in: Mathematical Foundations of Computer Science 1989, number 379 in Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1989, pp. 237-248.
26. M. Hennessy, A fully abstract denotational semantics for the π-calculus, Theoretical Computer Science 278 (1-2) (2002) 53-89.
27. M. Hennessy, H. Lin, Symbolic bisimulations, Theoretical Computer Science 138 (2) (1995) 353-389.
28. T. Hildebrandt, V. Sassone, Comparing transition systems with independence and asynchronous transition systems, in: U. Montanari, V. Sassone (Eds.), CONCUR'96, Proceedings of the 7th International Conference on Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1996, pp. 84-97.
29. M. Hofmann, Semantical analysis of higher-order abstract syntax, in: LICS '99 [37], pp. 204-213.
30. K. Honda, Behavioural subtyping in name passing synchronisation trees. Available from 〈http://www.dcs.qmw.ac.uk/~kohei/〉, 1999.
31. K. Honda, M. Tokoro, An object calculus for asynchronous communication, in: Proceedings of ECOOP'91 European Conference on Object-Oriented Programming, vol. 512 of Lecture Notes in Computer Science, 1991, pp. 133-147.
32. B. Jacobs. Categorical Logic and Type Theory, Number 141 in Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1999.
33. L. Jagadeesan, R. Jagadeesan, Causality and true concurrency: a data-flow analysis of the pi-calculus (extended abstract), in: Proceedings of AMAST '95, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995, pp. 277-291.
34. A. Joyal, M. Nielsen, G. Winskel, Bisimulation from open maps, Information and Computation 127 (2) (1996) 164-185.
35. A. Kiehn, Comparing locality and causality based equivalences, Acta Informatica 31 (1994) 697-718.
36. LICS '96, Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1996.
37. LICS '99, Proceedings of the Fourteenth Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, 1999.
38. H. Lin, Symbolic bisimulations and proof systems for the pi-calculus, Technical Report 1994:07, COGS, University of Sussex, 1994.
39. S. Mac Lane, in: Categories for the Working Mathematician, Graduate Texts in Mathematics, vol. 5, Springer-Verlag, Berlin, 1971.
40. S. Mac Lane, I. Moerdijk, Sheaves in Geometry and Logic: A First Introduction to Topos Theory, Springer-Verlag, Berlin, 1992.
41. A.W. Mazurkievicz, J. Winkowski (Eds.), Proceedings of the 8th International Conference on Concurrency Theory, CONCUR'97, volume 1243 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1997.
42. R. Milner, Communication and Concurrency, International Series in Computer Science, Prentice-Hall, Englewood Cliffs, NJ, 1989.
43. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes. II, Information and Computation 100 (1) (1992) 41-77.
44. R. Milner, J. Parrow, D. Walker, Modal logics for mobile processes, Theoretical Computer Science 114 (1) (1993) 149-171.
45. U. Montanari, M. Pistore, Concurrent semantics for the π-calculus, in: MFPS XI, Mathematical Foundations of Programming Semantics, Eleventh Annual Conference, volume 1 of ENTCS, Elsevier, Amsterdam, 1995, pp. 337-356.
46. U. Montanari, M. Pistore, π-calculus, structured coalgebras and minimal HD-automata, in: M. Nielsen, B. Rovan (Eds.), Mathematical Foundations of Computer Science 2000, volume 1893 of Lecture Notes in Computer Science, Springer, Berlin, 2000.
47. L.C. Paulson, The inductive approach to verifying cryptographic protocols, Journal of Computer Security 6 (1998) 85-128.
48. P. Quaglia, On the finitary characterization of π-congruences, Technical Report RS-97-52, BRICS, Aarhus University, 1997.
49. A. Rabinovitch, B. Traktenbrot, Behaviour structures and nets, Fundamenta Informatica 11 (4) (1988) 357-404.
50. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, PhD thesis, University of Edinburgh, 1992.
51. D. Sangiorgi, π-calculus, internal mobility, and agent-passing calculi, Theoretical Computer Science 167 (2) (1996) 235-274.
52. V. Sassone, M. Nielsen, G. Winskel, Models for concurrency: towards a classification, Theoretical Computer Science 170 (1-2) (1996) 297-348.
53. P. Selinger, First order axioms for asynchrony, in: Mazurkievicz and Winkowski [41], pp. 376-390.
54. P. Sewell, On implementations and semantics of a concurrent programming language, in: Mazurkievicz and Winkowski [41], pp. 391-405.
55. P. Sewell, Pi calculi (Chapter 9), in: H. Bowman, J. Derrick (Eds.), Formal Methods for Distributed Processing, An Object Oriented Approach, CUP, Dec. 2001. Extended version as University of Cambridge TR 498, 2000, pp. 177-197.
56. P. Sewell, J. Vitek, Secure composition of untrusted code: box-π, wrappers and causality types, Journal of Computer Security 11 (2) (2003) 135-188.
57. M.W. Shields, Concurrent machines, Theoretical Computer Science 28 (1985) 449-465.
58. I. Stark, A fully abstract domain model for the π-calculus, in: LICS'96 [36], pp. 36-42.
59. W. Vogler, Generalized OM-bisimulation, Information and Computation 118 (1) (1995) 38-47.
60. G. Winskel, M. Nielsen, Models for concurrency, in: Handbook of Logic in Computer Science, vol. 4, Oxford Science Publishers, Oxford University Press, 1995, pp. 1-148.