James Riely and Matthew Hennessy. Distributed processes and location failures. In Automata, Languages and Programming: Proceedings of the 24th International Colloquium ICALP '97, Lecture Notes in Computer Science 1256, pages 471--481. Springer-Verlag, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... process calculi has emphasised operational equivalences and compositional descriptions of processes, and recently systems with dynamic local name generation with calculi based on the calculus of Milner, Parrow and Walker [MPW92] A few calculi have dealt with failure, including [AP94,FGL 96,RH97,BH00] Building on process calculi, a number of concurrent or distributed programming languages have been designed, with associated semantic work, including among others Occam, Facile, CML, Pict, JoCaml, and Nomadic Pict [INM87,TLK96,Rep91,PT00,FGL 96,WS00] Little of this work, however, deals ....

J. Riely and M. Hennessy. Distributed processes and location failures. In Automata, Languages and Programming, LNCS 1256. Springer, 1997.

....This has been developed further in [Ama97] using a type system that ensures receptiveness. In [FGL 96] it is shown that the Distributed Join Calculus, which includes primitives modelling the failure of subtrees of locations, can be encoded into the calculus without distribution primitives. In [RH97] Riely and Hennessy give direct characterisations of barbed bisimulation congruences for a CCS like calculus extended with locations and failure. Finally, in [SY97] Sekiguchi and Yonezawa give a calculus in which a number of different mechanisms for code and data migration can be described. ....

....taking locations to model individuals, the tree structure and migration of locations become superfluous. Behavioural equivalences In order to reason about dpi processes a labelled transition system and behavioural congruence are required, perhaps building on the work of Riely and Hennessy [RH97], together with an understanding of the appropriate extensional equivalence, building on [Sew97] Acknowledgements The author would like to thank C edric Fournet, Benjamin Pierce, Pawel Wojciechowski and the Cambridge Thursday morning group, for interesting discussions about this work, and the ....

James Riely and Matthew Hennessy. Distributed processes and location failures. In Proceedings of ICALP '97. LNCS 1256, pages 471--481. Springer-Verlag, July 1997. REFERENCES 57

.... process calculi has emphasised operational equivalences and compositional descriptions of processes, and recently systems with dynamic local name generation with calculi based on the calculus of Milner, Parrow and Walker [MPW92] A few calculi have dealt with failure, including [AP94,FGL 96,RH97,BH00] Building on process calculi, a number of concurrent or distributed programming languages have been designed, with associated semantic work, including among others Occam, Facile, CML, Pict, JoCaml, and Nomadic Pict [INM87,TLK96,Rep91,PT00,FGL 96,WS00] Little of this work, however, deals ....

James Riely and Matthew Hennessy. Distributed processes and location failures. In Automata, Languages and Programming, volume 1256 of LNCS, pages 471-481, Bologna, Italy, 7-11 July 1997. Springer-Verlag. Andrei Serjantov Peter Sewell Keith Wansbrough

....is based on mobile computation and mobile code to deal with latency and firewall problems [23, 11, 12, 44, 30] Much of the aforesaid work has focused on access control for mobile computation in networks, as well as tracking the trustworthiness of hosts. Although some work has looked at failures [2, 24, 43, 1], it has assumed a fail stop model of failures that is not always a good match for programming in asynchronous distributed systems. The synchronous message sending operations of CCS and the pi calculus require global atomic commitment and therefore are unimplementable in an asynchronous ....

James Riely and Matthew Hennessy. Distributed processes and location failures. In Proceedings of the International Conference on Automata, Languages and Programming, 1997.

....[AP94] for modelling the failure semantics of Facile [TLK96] The Distributed Join Calculus of Fournet et al. [FGL 96] intended as the basis for a mobile agent language. The language of located processes and the D calculus of Riely and Hennessy, used to study the semantics of failure [RH97,RH98] and typing for control of resource use by mobile agents [HR98b,HR98a] The calculus of Sekiguchi and Yonezawa [SY97] used to study various primitives for code and data movement. The dpi calculus of Sewell [Sew97a,Sew98] used to study a subtyping system for locality enforcement of ....

James Riely and Matthew Hennessy. Distributed processes and location failures. In Proceedings of ICALP '97. LNCS 1256, pages 471-481. SpringerVerlag, July 1997.

....be the contents of the message in the higher order p calculus. More recent calculi have built on the example of the p calculus to provide a foundation for wide area languages where computation can migrate across the network. The Dp calculus (distributed p calculus) includes a notion of locations [41]. Each process executes at a locality. A go instruction (inspired by the go operation in Telescript) migrates a running process from one location to another. The primary motivation for the Abstractions for Fault Tolerant Wide Area Network Programming Languages 7 Dp calculus has been in reasoning ....

....must abort. So nested transactions incorporate a notion of partial failures. In work on the foundations of wide area languages, there has been limited consideration of failures. The Dp calculus and the distributed join calculus incorporate notions of locations and failures of locations [41, 21]. On the other hand, these approaches assume a fail stop model of failures. Although this is reasonable for programming in local area networks, it is an unrealistic assumption in wide area networks. As already noted, wide area networks essentially constitute asynchronous systems, where no bounds ....

James Riely and Matthew Hennessy. Distributed processes and location failures. In Proceedings of the International Conference on Automata, Languages and Programming, 1997.

....to set in statehvi j reply get; set to ref in letg 1 ; s 1 = ref(7) in letg 2 ; s 2 = ref( seven ) in : 4 The join calculus with locations The join calculus has been introduced to impose locality on definitions of channels inside the syntax of terms. There are other solutions proposed by [3, 1, 21, 25] where this is achieved through (linear) typing, since as exposed in the introduction it is preferable to have the uniqueness of the location which defines a channel. Our caveat is that the syntax is enough, and that we can speak of locality in an untyped world. It is possible to add types to the ....

J. Riely and M. Hennessy. Distributed processes and location failures. Report 2/97, University of Sussex, Brighton, April 1997.

....join calculus [15] and its implementations, or the secure join calculus of [1] To this aim, the information carried by the labels could be extended to manifest other properties of interest. Such approaches have been recently explored in other process calculi by Amadio [2] and Hennessy and Riely [30] for coping with partial failures in distributed systems, and by Boreale et al. for dealing with cryptography [7] Acknowledgments Preliminary results in collaboration with Michele Boreale appeared in [6] We also thank Jean Jacques L evy, Massimo Merro, Uwe Nestmann, and especially Georges ....

James Riely and Matthew Hennessy. Distributed processes and location failures. In Degano et al. [11], pages 471--481.

....of the base calculus; remote names are pairs site name, called located names. Sites abstract nodes in a network. They are composed of located processes processes paired with site identifiers denoting the execution of the process in the site, which is similar to most proposals to date [1,7,8,14,16]. Located processes can be put to run in parallel. Furthermore, since name passing calculi are capable of extruding the scope of a (local) name, our networks are equipped with a located name restriction operation. In summary, networks are located processes equipped with a composition and a ....

....calculi are capable of extruding the scope of a (local) name, our networks are equipped with a located name restriction operation. In summary, networks are located processes equipped with a composition and a restriction operator, yielding a flat organization of sites quite close to Distributed # [14], and in contrast with the tree structure of Mobile Join [7] and the nested structure of Ambients [5] The model encompasses two levels: processes and networks (cf. 1,8,14] Local computations happen at located processes, as prescribed by the semantics of the base calculus. What do we want for ....

[Article contains additional citation context not shown here]

James Riely and Matthew Hennessy. Distributed processes and location failures. In Pierpaolo Degano, Roberto Gorrieri, and Alberto MarchettiSpaccamela, editors, Proceedings of ICALP '97, volume 1256 of LNCS, pages 471--481. Springer, 1997. Full version as Report 2/97, University of Sussex, Brighton.

....of the base calculus; remote names are pairs site name, called located names. Sites abstract nodes in a network. They are composed of located processes processes paired with site identifiers denoting the execution of the process in the site, which is similar to most proposals to date [1,7,8,14,16]. Located processes can be put to run in parallel. Furthermore, since name passing calculi are capable of extruding the scope of a (local) name, our networks are equipped with a located name restriction operation. In summary, networks are located processes equipped with a composition and a ....

....calculi are capable of extruding the scope of a (local) name, our networks are equipped with a located name restriction operation. In summary, networks are located processes equipped with a composition and a restriction operator, yielding a flat organization of sites quite close to Distributed [14], and in contrast with the tree structure of Mobile Join [7] and the nested structure of Ambients [5] The model encompasses two levels: processes and networks (cf. 1,8,14] Local computations happen at located processes, as prescribed by the semantics of the base calculus. What do we want for ....

[Article contains additional citation context not shown here]

James Riely and Matthew Hennessy. Distributed processes and location failures. In Pierpaolo Degano, Roberto Gorrieri, and Alberto MarchettiSpaccamela, editors, Proceedings of ICALP '97, volume 1256 of LNCS, pages 471--481. Springer, 1997. Full version as Report 2/97, University of Sussex, Brighton.

....explicit in the syntax. Local names are those of the base calculus; remote names are pairs site name, called site names. Sites are composed of located processes, i.e. processes paired with site identifiers. They denote the execution of the process at the site, similarly to most proposals to date [2, 9, 10, 17, 16]. Processes at sites can be put to run in parallel. Furthermore, since name passing calculi are capable of extruding the scope of a (local) name, our networks are equipped with a site name restriction operation. In summary, networks are sites equipped with a composition and a restriction ....

....clusters of PCs interconnected with a high speed network. We feel that, the site organization should map the low level hardware architecture as closely as possible to allow an e#cient implementation of the model. From a formal point of view our site organization is quite close to Distributed # [16] and contrasts with the tree structure of Mobile Join [8] and the nested structure of Ambients [5] The model has two logical levels: processes and networks (cf. 2, 10, 16] Local computations happen at sites, as prescribed by the semantics of the base calculus. Remote computations occur between ....

[Article contains additional citation context not shown here]

James Riely and Matthew Hennessy. Distributed Processes and Location Failures. In ICALP '97, volume 1256 of LNCS, pages 471--481. Springer-Verlag, 1997.

No context found.

James Riely and Matthew Hennessy. Distributed processes and location failures. In Automata, Languages and Programming: Proceedings of the 24th International Colloquium ICALP '97, Lecture Notes in Computer Science 1256, pages 471--481. Springer-Verlag, 1997.

No context found.

J. Riely, M. Hennessy, Distributed processes and location failures, in: Proceedings of the International Conference on Automata, Languages and Programming, 1997.

No context found.

James Riely and Matthew Hennessy. Distributed processes and location failures. In Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, Proceedings of ICALP '97, volume 1256 of LNCS, pages 471--481. Springer, 1997. Full version as CogSci Report 2/97, University of Sussex, Brighton. 7

No context found.

James Riely and Matthew Hennessy. Distributed processes and location failures. In Automata, Languages and Programming: Proceedings of the 24th International Colloquium ICALP '97, Lecture Notes in Computer Science 1256, pages 471--481. Springer-Verlag, 1997.

No context found.

J. Riely and M. Hennessy. Distributed processes and location failures. In Degano et al. [13], pages 471-481.

No context found.

J. Riely and M. Hennessy, Distributed Processes and Location Failures, ICALP'97, LNCS, vol. 1256, pp.471-481, Springer, 1997.

No context found.

James Riely and Matthew Hennessy. Distributed processes and location failures. In Pierpaolo Degano, Robert Gorrieri, and Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, volume 1256 of lncs, pages 471-481. Springer Verlag, Berlin, 1997.

No context found.

James Riely and Matthew Hennessy. Distributed processes and location failures. In Proceedings of ICALP '97. LNCS 1256, pages 471-481. Springer-Verlag, July 1997.

No context found.

Riely, J., and Hennessy, M. Distributed processes and location failures. TCS 226 (2001).

No context found.

James Riely and Matthew Hennessy. Distributed processes and location failures. TCS, to appear.

No context found.

James Riely and Matthew Hennessy. Distributed processes and location failures. TCS, to appear.

No context found.

J. Riely and M. Hennessy. Distributed processes and location failures. In Automata, Languages and Programming, LNCS 1256. Springer, 1997.

No context found.

James Riely and Matthew Hennessy. Distributed processes and location failures. In Pierpaolo Degano, Roberto Gorrieri, and Alberto MarchettiSpaccamela, editors, Proceedings of ICALP '97, volume 1256 of Lecture Notes in Computer Science, pages 471-481. Springer, 1997. Full version as CogSci Report 2/97, University of Sussex, Brighton.

No context found.

James Riely and Matthew Hennessy. Distributed processes and location failures. In Annual International Colloquium on Automata, Languages and Programming, all, volume 24, 1997.

First 50 documents

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