I. Castellani. Process algebras with localities. In Handbook of Process Algebra, J. Bergstra, A. Ponse and S. Smolka (eds). Elsevier, 2001.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....conditions for key primitives that make its implementation difficult [14] It also suffers from not adequately accounting for the variety of barriers that may occur in a large scale distributed setting. Several other distributed process calculi, based on notions of locations or localities [8], have tried to address them. For instance, Nomadic Pict [22] provides process mobility; the 1l calculus [1] and the distributed join calculus with failures [13] embody both process mobility and failure detection; other calculi, such as the D calculus [16] and KLAIM [9] provide both process ....

....requirement: Requirement 5 A distributed programming model should allow the dynamic creation of new cells, and should provide the ability to move all, or part of, a cell plasm from one cell to another. These requirements are not adequately covered by current distributed process calculi (see [8] and [27] for recent overviews) For instance, the distributed join calculus partially satisfies requirement 1, but fails to satisfy 3 and 4, and only very partially satisfies 2, and 5. The Ambient calculus does not satisfy requirement 1 as demonstrated e.g. in [14] does not satisfy 3 and 4, and ....

I. Castellani : "Process Algebras with Localities" -- in Handbook of Process Algebra, J. Bergstra, A. Ponse and S. Smolka (eds), Elsevier, 2001.

....and the EC Research Training Network Games and Automata for Synthesis and Validation (GAMES) Further interesting conclusions follow from the fact that many non interleaving equivalences coincide on BPP. As mentioned in [12] Kiehn proved in her unpublished draft [23] that location equivalence [7], causal equivalence [11] and distributed bisimilarity all coincide on CPP, a sublanguage of BPP without explicit , hence also on BPP. Furthermore, causal equivalence and history preserving bisimilarity [13] coincide on BPP by the result of Aceto [1] moreover, Frschle showed coincidence of ....

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, S. Smolka, eds., Handbook of Process Algebra, chapter 15, pages 945--1046, 2001.

....the supports of successive reactions and determine which are disjoint. This deserves further study. Locality In this paper I have avoided giving a technical meaning to the word location, because it already has a rich variety of meanings in concurrency. These are thoroughly surveyed by Castellani [3] in the recently published Handbook of Process Algebras. Her broad classification is into abstract locations which crudely simplified keep track of causal independency (discussed above) and concrete locations which form an essential ingredient of behaviour (e.g. they can be manipulated as ....

Castellani, I. (2001), Process algebras with localities. Handbook of Process Algebra (eds. Bergstra, Ponse and Smolka), Elsevier, Amsterdam, pp947--1045.

.... mobile computing have been proposed, including, for example, the Join calculus [12] the # 1l calculus [2] the Ambient calculus 5 [9] the Safe Ambient calculus [23] the Seal calculus [32] the D# calculus [20] the D## calculus [33] DiTyCO [24] Nomadic Pict [27] KLAIM [26] Oz [28] see [10] for a survey of process calculi with localities) Also, various extensions of the Actor model, such as [14] have recently been proposed which aim to adapt the actor model of computation to large scale distributed and mobile computing. Very often, these models centre around notions of localities ....

I. Castellani. Process algebras with localities. In Handbook of Process Algebra, J. Bergstra, A. Ponse and S. Smolka (eds). Elsevier, 2001.

.... and t 0, P 1 ; P 2 ] then Q [Q 1 ; Q 2 ] for some Q 1 ; Q 2 such that (P 1 ; Q 1 ) 2 [Q 1 ; Q 2 ] then P [P 1 ; P 2 ] for some P 1 ; P 2 such that (P 1 ; Q 1 ) 2 The distributed equivalence was also called distributed bisimulation equivalence or distributed bisimilarity [Cas88,Chr92,Chr93,Cas01]. In the next section we show that the two equivalences coincide on BPP. 2 Distributed and performance equivalences coincide on BPP Theorem 1. For any BPP processes (P 1 ; P 2 ; and any duration function f , P 1 ; P 2 ; iff (P 1 ; P 2 ; In particular, ....

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, S. Smolka, eds., Handbook of Process Algebra, chapter 15, pages 945--1046, 2001.

....of this work has been performed during the author s post doc stay at Laboratoire Specification et Verification, ENS Cachan. Partially supported by the KBN grant 7 T11C 002 21 and the EC Research Training Network Games and Automata for Synthesis and Validation (GAMES) that location equivalence [7], causal equivalence [11] and distributed bisimilarity all coincide on CPP, a sublanguage of BPP without explicit . Further, causal equivalence and history preserving bisimilarity [13] coincide on BPP by the result of Aceto [1] moreover, Frschle showed coincidence of distributed and history ....

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, S. Smolka, eds., Handbook of Process Algebra, chapter 15, pages 945--1046, 2001.

.... for distributed and mobile computing have been proposed, including, for example, the Join calculus [16] the p 1l calculus [2] the Ambient calculus [10] the Safe Ambient calculus [25] the Seal calculus [37] the Dp calculus [22] DiTyCO [26] Nomadic Pict [28] KLAIM[14] Oz [30] see also [11] for a survey of process calculi with localities) Also, various extensions of the Actor model [18] have recently been proposed which aim to adapt the actor model of computation to large scale distributed and mobile computing. Very often, these models centre around notions of localities or sites, ....

I. Castellani. Process Algebras with Localities. in Handbook of Process Algebra (J. Bergstra, A. Ponse and S. Smolka, Eds), Elsevier (2001) 945-1045.

....bisimilarity, in the light of the recent PSPACE lower bound for the latter one by Srba [28] Further interesting conclusions follow from the fact that many non interleaving equivalences coincide on BPP. As mentioned in [13] Kiehn proved in her unpublished draft [24] that location equivalence [7], causal equivalence [11] and distributed bisimilarity all coincide on CPP, a sublanguage of BPP without explicit . Further, causal equivalence and history preserving bisimilarity [12, 14, 27] coincide on BPP by the result of Aceto [1] moreover, Frschle showed coincidence of distributed and ....

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, S. Smolka, eds., Handbook of Process Algebra, chapter 15, pages 945--1046, 2001.

....conditions for key primitives that make its implementation difficult [12] It also suffers from not adequately accounting for the variety of barriers that may occur in a large scale distributed setting. Several other distributed process calculi, based on notions of locations or localities [7], have tried to address them. For instance, Nomadic Pict [19] provides process mobility; the 1l calculus [1] and the distributed join calculus with failures [11] embody both process mobility and failure detection; other calculi, such as the D calculus [13] and KLAIM [8] provide both process ....

....requirement Requirement 5 A distributed programming model should allow the dynamic creation of new cells, and should provide the ability to move all, or part of, a cell plasm from one cell to another. 3 These requirements are not adequately covered by current distributed process calculi (see [7] and [24] for recent overviews) For instance, the distributed join calculus partially satisfies requirement 1, but fails to satisfy 3 and 4, and only very partially satisfies 2, and 5. The Ambient calculus does not satisfy requirement 1 as demonstrated e.g. in [12] does not satisfy 3 and 4, and ....

I. Castellani : "Process Algebras with Localities" -- in Handbook of Process Algebra, J. Bergstra, A. Ponse and S. Smolka (eds), Elsevier, 2001. 17

....conditions for key primitives that make its implementation difficult [14] It also suffers from not adequately accounting for the variety of barriers that may occur in a large scale distributed setting. Several other distributed process calculi, based on notions of locations or localities [8], have tried to address them. For instance, Nomadic Pict [22] provides process mobility; the 1l calculus [1] and the distributed join calculus with failures [13] embody both process mobility and failure detection; other calculi, such as the D calculus [16] and KLAIM [9] provide both process ....

....requirement Requirement 5 A distributed programming model should allow the dynamic creation of new cells, and should provide the ability to move all, or part of, a cell plasm from one cell to another. These requirements are not adequately covered by current distributed process calculi (see [8] and [27] for recent overviews) For instance, the distributed join calculus partially satisfies requirement 1, but fails to satisfy 3 and 4, and only very partially satisfies 2, and 5. The Ambient calculus does not satisfy requirement 1 as demonstrated e.g. in [14] does not satisfy 3 and 4, and ....

I. Castellani : "Process Algebras with Localities" -- in Handbook of Process Algebra, J. Bergstra, A. Ponse and S. Smolka (eds), Elsevier, 2001.

No context found.

I. Castellani. Process algebras with localities. In Handbook of Process Algebra, J. Bergstra, A. Ponse and S. Smolka (eds). Elsevier, 2001.

No context found.

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 945--1045. Elsevier Science, 2001.

No context found.

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 945--1045. Elsevier Science, 2001.

No context found.

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, and S. Smolka, (Eds), Handbook of Process Algebra, 945--1045, North-Holland, 2001.

No context found.

Castellani, I. (2001), Process algebras with localities. Handbook of Process Algebra, eds Bergstra, Ponse and Smolka, Elsevier, pp947--1045.

No context found.

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 945--1045. Elsevier Science, 2001.

No context found.

I. Castellani. Process algebras with localities. In Handbook of Process Algebra, pages 945--1045. North-Holland, 2001.

No context found.

Castellani, I. (2001), Process algebras with localities. Handbook of Process Algebra, eds Bergstra, Ponse and Smolka, Elsevier, pp947--1045.

No context found.

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, pages 945--1045. Elsevier Science, 2001.

No context found.

Castellani, I. (2001), Process algebras with localities. Handbook of Process Algebra, eds Bergstra, Ponse and Smolka, Elsevier, pp947--1045.

No context found.

Ilaria Castellani. Process algebras with localities. In [17], chapter 15. NorthHolland, 2001.

No context found.

I. Castellani. Process algebras with localities. In J. Bergstra, A. Ponse, and S. Smolka, (Eds), Handbook of Process Algebra, 945--1045, North-Holland, 2001.

No context found.

Ilaria Castellani. Process algebras with localities. In [17], chapter 15. NorthHolland, 2001.

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