Distributed processes and location failures

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

Volumn 1256, Issue , 1997, Pages 471-481

  Riely, James ^a   Hennessy, Matthew ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; COMPUTER PROGRAMMING LANGUAGES; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; FORMAL LOGIC; ROBOTS; SEMANTICS;

DISTRIBUTED PROCESS; DISTRIBUTED SYSTEMS; LOGICAL FORMULAS; OPERATIONAL SEMANTICS; PROCESS CALCULI; PROGRAMMING LANGUAGE SEMANTICS; PROPOSITIONAL LOGIC; REMOTE LOCATION;

LOCATION;

EID: 84951178374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_203     Document Type: Conference Paper

References (22)

1. Samson Abramsky. The lazy lambda calculus. In Research Topics in Functional Programming, pages 65-117. Addison-Wesley, 1990.
2. Roberto Amadio and Sanjiva Prasad. Localities and failures. In FST-TCS, volume 880 of LNCS. Springer, 1994.
3. Roberto Amadio. From a concurrent λ-calculus to the n-calculus. In Foundations of Computation Theory, volume 965 of LNCS. Springer, 1995.
4. Roberto Amadio. An asynchronous model of locality, failure, and process mobility. Technical report, Laboratoire d'Informatique de Marseille, 1997.
5. Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous π-calculus. In CONCUR96, volume 1119 of LNCS, pages 147-162. Springer, 1996.
6. J. C. M Baeten and W. P. Weijland. Process Algebra. Cambridge University Press, 1990.
7. G. Boudol. A lambda calculus for (strict) parallel functions. Information and Control, 108:51-127,1994.
8. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. A theory of processes with localities. Formal Aspects of Computing, 6:165-200,1994.
9. I. Castellani. Observing distribution in processes: static and dynamic localities. International Journal of Foundations of Computer Science, 6(6):353-393,1995.
10. Flavio Corradini. Space, Time and Nondeterminismin Process Algebras. PhD thesis, Università Degli Studi di Roma “La Sapienza”, 1996.
11. C. Fournet and G. Gonthier. The refliexive CHAM and the join-calculus. In POPL94. ACM Press, 1994.
12. C. Fournet, G. Gonthier, J.J. Levy, L. Marganget, and D. Remy. A calculus of mobile agents. In CONCUR96, volume 1119 of LNCS, pages 406-421. Springer, 1996.
13. A. Giacalone, P. Mishra, and S. Prasad. A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2): 121-160,1989.
14. Andrew D. Gordon. Bisimilarity as a theory of functional programming. In MFPS, volume 1 of ENTCS, http://pigeon.elsevier.nl/mcs/tcs/pc/Menu.html. Elsevier, 1995.
15. M. C. B. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353-389,1995.
16. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
17. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent System: Specification. Springer, 1992.
18. Robin Milner. Communication and concurrency. Prentice-Hall, 1989.
19. Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes. Information and Computation, 100(1), September 1992.
20. Ugo Montanari and Daniel Yankelovich. Partial order localities. In ICALP92, volume 623 of LNCS, pages 617-628. Springer, 1992.
21. James Riely and Matthew Hennessy. Distributed processes and location failures. Technical Report 2/97, University of Sussex, Department of Computer Science, http://www.cogs.susx.ac.uk, 1997.
22. Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1992.