G. Boudol, I. Castellani, M. Hennessy, A. Kiehn, Observing localities, Theoretical Comput. Sci. 114 (####) 31-61.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....constructors, adding the same auxiliary structure. For example, Ferrari and Montanari (1997) have de ned interesting tile models for the (asynchronous) calculus (Milner, Parrow and Walker 1992) and for the representation of both the operational and the abstract semantics of CCS with locations (Boudol, Castellani, Hennessy and Kiehn 1993) where both con gurations and observations are term graphs (Eekele, Plasmeijer, and Sleep 1993) Term graphs are a reference oriented generalization of the ordinary (value oriented) notion of term, where the sharing of subterms can be speci ed also for closed (i.e. without variables) term graphs. ....

.... shown useful to de ne a tile model for the (asynchronous) calculus (Milner, Parrow and Walker 1992) one of the most studied mobile calculi, in (Ferrari and Montanari 2000) In the same paper they have been used to represent both the operational and the abstract semantics of CCS with locations (Boudol, Castellani, Hennessy and Kiehn 1993) within the tile model. In both cases, the general notion of tile bisimilarity (Gadducci and Montanari 2000) is employed to quotient out con gurations, thus recovering the ordinary abstract semantics. Moreover, although name extrusion and handling makes the transition system for the operational ....

Boudol, G., Castellani, I., Hennessy, M. and Kiehn, A. (1993) Observing Localities. TCS 114, 31-61.

....Locality Distributed systems often consist of processors allocated remotely. The correctness of distributed computation is not independent of the locations at which processors are allocated. Several researchers propose process calculi which have the notion of spatial locality, for example see [9, 13, 39, 56]. The basic idea of these calculi is to assign localities to processes and actions. They distinguish between actions which occur at di#erent locations, even when the actions have the same name. However, none of the previous attempts to study a relationship between spatial locality and ....

A. Kiehn, I. Castellani, M. Hennessy, and G. Boudol. Observing Localities. In Proceedings, Symposium on Mathematical Foundations of Computer Science, volume 520 of Lecture Notes in Computer Science. Springer-Verlag, 1991. BIBLIOGRAPHY 89

....For a study of the correspondence between the two concepts, see Sangiorgi [15] An important consideration in migration is that of locality, namely the explicit association between agents and specific sites. Several calculi supporting this notion have been presented recently; see for instance [5, 6, 10]. Of these, however, only Fournet et al. s Distributed Join Calculus [10] treats locality in combination with migration. This is done in style of the Chemical Abstract Machine, by creating a flat model of local solutions with associated local names, and organising them as an implicit tree of nested ....

G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. TCS, 114(1):31--61, June 1993.

....Locality Distributed systems often consist of processors allocated remotely. The correctness of distributed computation is not independent of the locations at which processors are allocated. Several researchers propose process calculi which have the notion of spatial locality, for example see [9, 13, 39, 56]. The basic idea of these calculi is to assign localities to processes and actions. They distinguish between actions which occur at different locations, even when the actions have the same name. However, none of the previous attempts to study a relationship between spatial locality and ....

A. Kiehn, I. Castellani, M. Hennessy, and G. Boudol. Observing Localities. In Proceedings, Symposium on Mathematical Foundations of Computer Science, volume 520 of Lecture Notes in Computer Science. Springer-Verlag, 1991. BIBLIOGRAPHY 89

....constructors, adding the same auxiliary structure. For example, Ferrari and Montanari (1997) have defined interesting tile models for the (asynchronous) calculus (Milner, Parrow and Walker 1992) and for the representation of both the operational and the abstract semantics of CCS with locations (Boudol, Castellani, Hennessy and Kiehn 1993) where both configurations and effects are term graphs (Corradini and Gadducci 1997) Term graphs are a reference oriented generalization of the ordinary (value oriented) notion of term, where the sharing of subterms can be specified also for closed (i.e. without variables) term graphs (terms can ....

.... to define a tile model for the (asynchronous) calculus (Milner, Parrow and Walker 1992) one of the most studied mobile calculi, in (Ferrari and Montanari 1997) In (Ferrari and Montanari 1997) they have been used to represent both the operational and the abstract semantics of CCS with locations (Boudol, Castellani, Hennessy and Kiehn 1993) within the tile model. In both cases, the general notion of tile bisimilarity (Gadducci and Montanari 1997) is employed to quotient out configurations, thus recovering the ordinary abstract semantics. Moreover, although name extrusion and handling makes the transition system for the operational ....

Boudol, G., Castellani, I., Hennessy, M. and Kiehn, A. (1993) Observing Localities. TCS 114, 31--61.

....a concise representation of our ideas. Comparison with related work. Previous work on localities has primarily concentrated on observing the spatial distribution of concurrent processes. The idea is to assign locations to processes and then to observe actions along with where they occur. In [BCHK91, BCHK94] the observer dynamically and incrementally assigns localities (access paths) to actions performed by located CCS processes while observing them; this approach is extended to the calculus in [San94] This dynamic localities approach , not surprisingly, amounts to observing local ....

G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing Localities. In SLNCS 520: Proceedings of MFCS 91. SpringerVerlag, 1991. Also appeared as TR 4-91, Univ. of Sussex, to appear in TCS.

....space limitation, we illustrate the application of the internal strategies described in the previous sections only for the simple example of finite CCS . We refer the reader to [6] for a more interesting example dealing with the tile system proposed by Ferrari and Montanari in [15] for located CCS [4]. Milner s Calculus for Communicating Systems (CCS) 27] is among the more well known and studied concurrency models. We present here an executable tile specification for a fragment of CCS, called finite CCS . Let Delta (ranged over by ff) be the set of basic actions, and Delta the set of ....

G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing Localities. TCS 114, 31--61 (1993).

....are interested in real life systems; especially in the case of system design, it is not too farfetched to suppose that the structure of the system is known. Moreover, recent approaches in processalgebra try to capture observationally not only the actions of a process, but also its structure ([FM91, BCH92]) From our point of view these proposals are at the moment too much concerned with the algebraic aspects of the theory and are not enough expressive. In a future we believe however that these theories will be the natural framework in which works as ours could be inserted and developed. ....

G. Boudol, I. Castellani, M. Hennessy, A. Kiehn. Observing localities (Extended Abstract) In: A. Tarlecki(ed.) Mathematical Foundations of Computer Science, LNCS 520, Springer-Verlag

.... freely copied, always yielding an equivalent term) Such structures have been shown useful in [17] to define a tile model for the (asynchronous) calculus [32] one of the most studied mobile calculi) and in [18] to represent both the operational and the abstract semantics of CCS with locations [3] within the tile model. In both cases, the general notion of tile bisimilarity [22] is employed to quotient out configurations, thus recovering the ordinary abstract semantics. Name extrusion and explicit handling make the transition system for the calculus infinite branching and require special ....

G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing Localities. TCS 114, 31--61 (1993).

....J. Herrera y Reissig 565. 11300 Montevideo. Uruguay. fechague,sierrag fing.edu.uy 1 Introduction In the framework of the so called true concurrency, the idea of causality has been widely studied [16, 15, 9, 7, 19] Localities, an idea somehow orthogonal to causality, has become also interesting [1, 4, 5, 13, 14, 12]. Causality states which events are necessary for the execution of a new one, while localities observes in which way the events are distributed. Both approaches have been shown not to be equivalent or to coincide in a very discriminating point [6, 20] The idea of the works on localities is to ....

G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. Theoretical Comput. Sci., 114:31--61, 1993.

No context found.

G. Boudol, I. Castellani, M. Hennessy, A. Kiehn, Observing localities, Theoretical Comput. Sci. 114 (####) 31-61.

No context found.

G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn. Observing localities. Technical Report 4/91, Computer Science, University of Sussex, 1991. (p 40)

No context found.

G. Boudol and I. Castellani. Observing localities. In Tarlecki [Tar91], 93--102.

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