Berger, M., "Towards Abstractions for Distributed Systems," Ph.D. thesis, Imperial College London (2002). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Electronic Notes in Theoretical Computer Science 39 No. 1 (2000) - Url Http Www Self-citation (Berger) (Correct)
No context found.
Martin Berger. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, Department of Computing, 2000. To appear.
Genericity and the π-Calculus - Berger, Honda, Yoshida Self-citation (Berger) (Correct)
No context found.
Berger, M. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, London, 2002. 48
Basic Theory of Reduction Congruence for Two Timed Asynchronous.. - Berger (2004) Self-citation (Berger) (Correct)
No context found.
Berger, M. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, London, 2002.
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) Self-citation (Berger) (Correct)
....side e ects to distributed computing, all of which may exhibit certain forms of genericity. The calculus is a small syntax for communicating processes in which we can precisely represent many classes of computational behaviours, from purely sequential functions to those of distributed systems [7, 9, 25, 41, 42]. Can we nd a uniform account of genericity for diverse classes of computational behaviour using the calculus This work presents our initial results in this direction, concentrating on a polymorphic variant of the linear ane calculus with state [9, 17, 41, 42] It turns out that the duality ....
Berger, M. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, Department of Computing, 2002.
Genericity and the π-Calculus - Berger, Honda, Yoshida (2002) Self-citation (Berger) (Correct)
....side eiects to distributed computing, all of which may exhibit certain forms of genericity. The F calculus is a small syntax for communicating processes in which we can precisely represent many classes of computational behaviours, from purely sequential functions to those of distributed systems [7, 9, 25, 41, 42]. Can we find a uniform account of genericity for diverse classes of computational behaviour using the F calculus This work presents our initial results in this direction, concentrating on a polymorphic variant of the linear alPine F calculus with state [9, 17,41,42] It turns out that the ....
BERGER, M. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, Department of Computing, 2002.
Genericity and the pi-Calculus - Berger, Honda, Yoshida (2 citations) Self-citation (Berger) (Correct)
....side e ects to distributed computing, all of which may exhibit certain forms of genericity. The calculus is a small syntax for communicating processes in which we can precisely represent many classes of computational behaviours, from purely sequential functions to those of distributed systems [5, 7, 17, 32, 33]. Can we nd a uniform account of genericity for diverse classes of computational behaviour using the calculus This work presents our initial results in this direction, concentrating on a polymorphic variant of the linear ane calculus with state [7, 12, 32, 33] It turns out that the duality ....
Berger, M. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, Department of Computing, 2002.
The Two-Phase Commitment Protocol in an Extended π-Calculus - Berger, Honda (2000) (9 citations) Self-citation (Berger) (Correct)
.... are congruences over networks. As a simple example of the failure of congruence consider P t = timer t (y:z; 0) Then P 1 P 2 . But xjP 1 is not bisimilar to xjP 2 (since, while the input action by the former inevitably makes it 0, that by the latter can still retain P 1 ) See [3] for further discussions. 11 Berger and Honda 4.3 Extending the Calculus (3) Process Failure and Persistence Message loss is not the only problem for distributed systems. Machines and processes in distributed systems can fail or crash. This is not speci c to distributed systems: however, ....
....relative expressiveness of the extended constructs. Message loss can be encoded by translating a site as a collection of forwarders of a certain kind [10,15] Essentially a site is translated into a system which takes care of all messaging from and to a site. On the other hand, timers are provably [3] not encodable fully abstractly and compositionally. We doubt that there is even a non trivial sound compositional encoding (there is compelling evidence that such an encoding is hard to obtain, even though there seems to be a non compositional way to represent global timing using speci c messages ....
[Article contains additional citation context not shown here]
Martin Berger. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, Department of Computing, 2000. To appear.
Modelling Dynamic Web Data - Gardner, Maffeis (Correct)
No context found.
Berger, M., "Towards Abstractions for Distributed Systems," Ph.D. thesis, Imperial College London (2002).
Modelling Dynamic Web Data - Gardner, Maffeis (Correct)
No context found.
Berger, M., "Towards Abstractions for Distributed Systems," Ph.D. thesis, Imperial College London (2002).
Modelling Dynamic Web Data - Gardner, Maffeis (2003) (Correct)
No context found.
Berger, M., "Towards Abstractions for Distributed Systems," Ph.D. thesis, Imperial College London (2002).
Modelling Dynamic Web Data - Philippa Gardner And (Correct)
No context found.
Berger, M.: Towards Abstractions for Distributed Systems. PhD thesis, Imperial College London (2002)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC