A filter model for mobile processes

Mathematical Structures in Computer Science

Volumn 9, Issue 1, 1999, Pages 63-101

  Damiani, Ferruccio ^a   Dezani Ciancaglini, Mariangiola ^a   Giannini, Paola ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976212834     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012959800259X     Document Type: Article

References (33)

1. Abramsky, S. (1991a) Domain Theory in Logical Form. Annals of Pure and Applied Logic 51 1–77.
2. Abramsky, S. (1991b) A Domain Equation for Bisimulation. Information and Computation 92 (2) 161–218.
3. Abramsky, S. and Ong, C.-H.L. (1993) Full Abstraction in the Lazy Lambda Calculus. Information and Computation 105 (2) 159–267.
4. Amadio, R. M. and Dam, M. (1996) Toward a modal theory of types for the null In: Formal Techniques in Real-Time and Fault-Tolerant Systems. Springer-Verlag Lecture Notes in Computer Science 1135 347–365.
5. Barendregt, H. R. (1984) The 2-Calculus — Its Syntax and Semantics, North-Holland.
6. Barendregt, H. P., Coppo, M. and Dezani-Ciancaglini, M. (1983) A Filter Lambda Model and the Completeness of Type Assignment. Journal of Symbolic Logic 48 (4) 931–940.
7. Boreale M. and De Nicola R. (1995) Testing Equivalence for Mobile Processes. Information and Computation 120 (2) 279–303.
8. Boreale M. and Sangiorgi D. (1996) Some Congruence Properties for null Bisimilarities. Technical Report RR-2870, INRIA-Sophia Antipolis.
9. Boudol G. (1994) A Lambda Calculus for (Strict) Parallel Functions. Information and Computation 108 (1) 51–127.
10. Dam M. (1993) Model Checking Mobile Processes. In: CONCUR’93. Springer-Verlag Lecture Notes in Computer Science 715 22–36.
11. De Nicola R. and Hennessy M. (1984) Testing Equivalences for Processes. Theoretical Computer Science 34 (1–2) 83–133.
12. De Nicola R. and Hennessy M. (1987) CCS without t’s. In: TAPSOFT’87. Springer-Verlag Lecture Notes in Computer Science 249 138–152.
13. Dezani-Ciancaglini M., de’Liguoro U. and Piperno A. (1996) Filter Models for Conjunctive-Disjunctive 2-calculi. Theoretical Computer Science 170(1-2) 83–128.
14. Dezani-Ciancaglini M., de’Liguoro U. and Piperno A. (1998) A Filter Model for Concurrent 2-calculi. SIAM Journal on Computing 27 (5) 1376–1419.
15. Fiore M.P., Moggi E. and Sangiorgi D. (1996) A Fully Abstract Model for the 7r-calculus. In: LICS’96, IEEE Comp. Soc. Press.
16. Hartonas T. and M. Hennessy M. (1997) Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing. Computer Science Technical Report 97:01, School of Cognitive and Computing Sciences, University of Sussex. (Extended Abstract in CSL’97.) Information and Computation (to appear).
17. Hennessy M.(1988) Algebraic Theory of Processes, MIT Press.
18. Hennessy M.(1991) A Model for the null Computer Science Technical Report 91:08, School of Cognitive and Computing Sciences, University of Sussex.
19. Hennessy M.( 1994a) A Fully Abstract Denotational Model for Higher-Order Processes. Information and Computation 112 (1) 55–95.
20. Hennessy M.( 1994b) Higher-order Processes and their Models. In: ICALP ’94. Springer-Verlag Lecture Notes in Computer Science 820 286–303.
21. Hennessy M.(1996) A Fully Abstract Denotational Semantics for the null Computer Science Technical Report 96:04, School of Cognitive and Computing Sciences, University of Sussex. Milner R. (1980) A Calculus of Communicating Systems. Springer-Verlag Lecture Notes in Computer Science 92.
22. Milner R. (1989) Communication and Concurrency, Prentice-Hall.
23. Milner R. (1991) The Polyadic null A Tutorial. Technical Report ECS-LFCS-91-180, Edin-burgh Univ. (Also in Logic and Algebra of Specification, Springer-Verlag, Berlin, 1993.)
24. Milner R. (1992) Functions as Processes. Mathematical Structures in Computer Science 2(2) 119–141.
25. Milner R., Parrow J. and Walker D. (1992) A Calculus of Mobile Processes, I and II. Information and Computation 100 (1) 1–77.
26. Milner R., Parrow J. and Walker D. (1993) Modal Logics for Mobile Processes. Theoretical Computer Science 114 (1) 149–171.
27. Oles F. J. (1985) Type Algebras, Functor Categories and Block Structures. Algebraic Methods in Semantics, Cambridge Univecsity Press 543–573.
28. Ong C.-H.L. (1993) Non-Determinism in a Functional Setting. In: LICS ’93, IEEE Comp. Soc. Press 275–286.
29. Sangiorgi D. (1992) Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, Ph. D. Thesis, University of Edinburgh.
30. Sangiorgi D. (1996) A Theory of Bisimulation for the null Acta Informatica 33 (1) 68–97.
31. Scott D. (1982) Domains for Denotational Semantics. In: ICALP’82. Springer-Verlag Lecture Notes in Computer Science 140 577–613.
32. Stark I. (1996) A Fully Abstract Domain Model for the null In: LICS’96, IEEE Comp. Soc. Press 36–42.
33. Thomsen B. (1990) Calculi for Higher-Order Communicating Systems, Ph. D. Thesis, Imperial College.