A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31:697718, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....remain decidable for BPPM . In the weak setting, pom and loc still conicide for BPP but when moving to BPPM this changes. In fact, they become incomparable which contrast the strong case where location equivalence is always ner then pomset. We have borrowed the following example from Kiehn [16] to show this. Example 34 For the BPPM processes r 1 = a:b:0 k b:c:0 a:c:0 and r 2 = a:b:0 k b:c:0; we have that r 1 pom r 2 and r 1 6 loc r 2 , and for BPPM processes b:a:0 a:0kc:0 and s 2 = a:b:0 k b:a:0; we have that s 1 loc s 2 and s 1 6 pom s 2 . 26 Theorem 35 ....

A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31:697-718, 1994.

....are also required in cases where the desired properties of systems are most naturally stated in terms of causality or locality. Here again there are model theoretic and syntactic approaches the rst is surveyed in [58] the second is represented by various annotated operational semantics, e.g. [16, 8, 15, 32, 58]. The two seem to have been carried out almost independently to our knowledge, the only works to make precise connections are [16, 8, 58] Moreover, only the syntactic approach has been developed to address name passing, in the annotated operational models of [6, 18] There is also work that ....

A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31:697-718, 1994.

....concurrent automata, recognizability. 1 Introduction. Partial orders and true concurrency models have been widely generalised in the last two decades for modeling distributed and or concurrent processes, while their relationships with Petri Nets Theory played a central role ( BC] BD] Gi] Gr] [K1] [NSW] Pr] Vo] Among the many variations on Petri Nets, the ones concerning the structure of arcs labels, tokens and markings led to important developments [Je] In the present paper, we define a new class of nets, Trace Channel Nets, TCNets in short, where the arcs labels and the markings of ....

Kiehn.A. Comparing locality and causality based equivalences. Acta Informatica 31 , 697-718, 1994. 19

....are also required in cases where the desired properties of systems are most naturally stated in terms of causality or locality. Here again there are model theoretic and syntactic approaches the rst is surveyed in [WN95] the second is represented by various annotated operational semantics, e.g. [DDNM88a, BC88, DD89, Kie94, WN95]. The two seem to have been carried out almost independently to our knowledge, the only works to make precise connections are [DDNM88a, BC88, WN95] Moreover, only the syntactic approach has been developed to address name passing, in the annotated operational models of [BS98, DP99] There is also ....

A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31:697718, 1994.

....are identified by a causality relation which traces the effects that an action has on those actions that it causes. In the literature there are essentially two kinds of non interleaving semantics for calculi without name passing such as CCS [17] namely the causal [29, 10, 7, 23, 4, 14] and local [5, 16] semantics. The former says that an activity t is caused by another, say t 0 , if t 0 is a necessary condition for the occurrence of t. The locality semantics was introduced to study the spatial distribution of resources. In practice, the only difference between the two notions is that the ....

....spatial distribution of resources. In practice, the only difference between the two notions is that the causal one cross updates the causes between the partners of communications, while locality semantics completely ignores communications. In fact, the two coincide when there are no communications [16, 11]. Recently a few papers [27, 2, 22, 6, 15] have begun to study this problem in the calculus [20, 21] However, many subtle aspects still have to be clarified, especially related to the explicit distinction between input and output actions and to the dependencies induced by the usage of names. ....

[Article contains additional citation context not shown here]

A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31(8):697--718, 1994.

....in this manner a dependence from them. For instance, in the case of CCS with localities [7] each transition exhibits, in addition to an action, also the location in which the action is supposed to happen, and new locations are generated by fork transitions. A similar case is CCS with causality [14, 13, 26]. Another quite interesting example is calculus [30, 29] It has the ability of sending channel names as messages and thus of dynamically recon guring process acquaintances. More importantly, calculus names can model objects (in the sense of object oriented programming [45] and name sending ....

....equates the HD automata obtained from two calculus agents if and only if the agents are bisimilar according to the ordinary calculus bisimilarity relation. These results do not hold only for the calculus: we present a similar mapping for CCS with localities [7] and for CCS with causality [14, 13, 26]. This shows that our de nition of HD automata and of HDbisimulation is adequate to describe interesting cases of history dependent calculi. HD automata can be also applied to concurrent formalisms outside the eld of process calculi: for instance, we show that they can be applied to Petri ....

[Article contains additional citation context not shown here]

A. Kiehn. Comparing locality and causality based equivalences Acta Informatica, 31(8):697-718, 1994.

....that we are aware of. The equivalences we discuss have been characterized in many ways. The location based equivalences have been studied, for example, in [8, 2, 9, 25, 27, 11] the cause based equivalences have appeared, for example, in [12, 13] Comparisons between these approaches appear in [21, 25, 14]. Most of these equivalences are defined for CCS, which does not have explicitly located processes. To apply these definitions to terms in our language, we Distributed Processes and Location Failures 39 first perform an implicit syntactic transformation that removes explict location references ....

....information. CCS interleaving equivalence [23] was defined in Section 2.3. Causal (C) equivalence [12] distinguishes processes based on the causality of actions. Locations (L) equivalence [8] distinguishes processes based on the local causality of actions. Local Global (LG) equivalence [21] distinguishes processes based on a combination of their local and global causes; it is strictly finer than the intersection of the C and L equivalences. Located Action (LA) equivalence [27, 11] is a finer form of locations equivalence in which location names appear in the syntax of the ....

A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31(8):697--718, 1994. Distributed Processes and Location Failures 43

....evolve into states which are divergent. Moreover we show that this property is itself decidable for BPP processes. These two equivalences were originally defined using very different meta languages for expressing and emphasising different intentional features of the behaviour of processes. In [Kie94] it is shown how location equivalence can be expressed in a general framework of causes, and here we show that the same framework can also be used to express ST2 bisimulation. This is central to our work. We develop one decision procedure based on a tableau method for local cause bisimulation ....

....shown how location equivalence can be expressed in a general framework of causes, and here we show that the same framework can also be used to express ST2 bisimulation. This is central to our work. We develop one decision procedure based on a tableau method for local cause bisimulation which from [Kie94] is known to be equivalent to location equivalence, BCHK93] We then show how very simple modifications lead to a decision procedures for ST bisimulation and finally we show how further modifications can be made so as to deal with weak versions of these equivalences. The general framework for ....

[Article contains additional citation context not shown here]

A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31:697--718, 1994.

No context found.

A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31:697718, 1994.

No context found.

A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31(8):697--718, 1994.

No context found.

A. Kiehn. Comparing locality and causality based equivalences. Acta Informatica, 31(8), 697--718, 1994. (pp 7, 9, 26, 32, 33, 35, 41, 42, 57, 66, 157)

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