4 citations found. Retrieving documents...
Parrow, J. and Victor, B. (1998). The tau-laws of fusion. In D. Sangiorgi and R. De Simone, editors, Proceedings of CONCUR'98 , volume 1466 of Lecture Notes in Computer Science, pages 99--114.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Complete Axiomatisations of Weak-, Delay- and η-Bisimulation.. - Luttik (1999)   (Correct)

....strong bisimulation. These languages include a restricted form of alternative quantification, called input prefixing, where quantification and action prefixing is combined into a single construct. Groote and Luttik (1998b) have shown that this form of alternative quantification is less expressive. Parrow and Victor (1998) deal with an extension of their fusion calculus with silent steps in weak bisimulation semantics. Their calculus also contains a single binder instead of input prefixing to express an input mechanism. Surprisingly, however, in their setting it is not possible to just add Milner s # laws; they ....

Parrow, J. and Victor, B. (1998). The tau-laws of fusion. In D. Sangiorgi and R. De Simone, editors, Proceedings of CONCUR'98 , volume 1466 of Lecture Notes in Computer Science, pages 99--114.


The Fusion Calculus - Posse   (Correct)

....important simplification is that there is only one sensible bisimulation equivalence. The present paper intends to give a brief overview of the fusion calculus. For a more comprehensive treatment, the reader is referred to Victor s Ph.D. thesis [V98] and related papers [VP98] PV98 1] and [PV98 2]. Concurrent Constraint Programming As a motivation to the fusion calculus a reminder of the Concurrent Constraint Programming paradigm is presented. In Constraint Programming the central notion is that of a constraint. A constraint can be seen as a guard that must be satisfied so that the ....

Parrow, J., Victor, B. The Tau Laws of Fusion. In Proceedings of CONCUR'98. LNCS vol 1443. Springer-Verlag. April 1998. URL: http://www.docs.uu.se/~victor/tr/taufusion.html


A Complete Axiomatisation of Branching Bisimulation for.. - Groote, Luttik (1998)   (Correct)

....From the results in the present paper we conclude that the complexity of Klusener s law is not caused by the combination of integration and internal activity. Other extensions of message passing process algebras with the silent step have been carried out by Hennessy and Lin (1996) Lin (1995) and Parrow and Victor (1998). Contrary to our approach, these extensions take place in a variant of weak bisimulation semantics of Milner (1980) In the first two papers the extension takes place in a setting with input prefixing instead of alternative quantification (we proved in Groote and Luttik (1998) that the input ....

....a setting with input prefixing instead of alternative quantification (we proved in Groote and Luttik (1998) that the input prefix mechanism is in general a less expressive operation than alternative quantification) In both papers it is shown that it suffices to add Milner s laws. The paper of Parrow and Victor (1998) deals with the extension of the fusion calculus with silent steps. In the fusion calculus there is a single binder that resembles our alternative quantification. The authors argue that, since mismatch operators do not distribute over prefixes in a setting with fusion actions, Milner s third law ....

Parrow, J. and Victor, B. (1998). The tau-laws of fusion. In D. Sangiorgi and R. De Simone, editors, Proceedings of CONCUR'98 , volume 1466 of Lecture Notes in Computer Science, pages 99--114.


Solos in Concert - Laneve, Victor (1999)   (2 citations)  Self-citation (Victor)   (Correct)

....we show that it can express both action prefix and guarded summation. One encoding gives a strong correspondence but uses a match operator; the other yields a slightly weaker correspondence but uses no additional operators. 1 Introduction The fusion calculus was introduced by Parrow and Victor [15, 20, 16] as a simplification and extension of the calculus [6] The simplification is easy to see: there is only one binding operator where has two; input and output are completely symmetric which they are not in ; and it has only one sensible bisimulation congruence where has three. The extension ....

....agrees with fex = e yg; ran(oe) e z = and dom(oe) e z P Gamma P 0 P j Q Gamma P 0 j Q P Gamma P 0 (x)P Gamma (x)P 0 P j Q Q Gamma Q 0 Q 0 j P 0 P Gamma P 0 Table 1. Reduction rules for the fusion calculus of solos. For examples and motivations we refer the reader to [15, 20, 16]. 2.3 Equivalence and Preorder We will use the standard idea of barbed bisimulation developed by Milner and Sangiorgi [7] in the setting of CCS, further investigated in a calculus setting by Sangiorgi [17] and later used in many other calculi as an intuitive observational equivalence. The idea ....

J. Parrow and B. Victor. The tau-laws of fusion. In Sangiorgi and de Simone [19], pages 99--114.

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