Davide Sangiorgi. A theory of bisimulation for the -calculus. Acta Informatica, 33:69-97, 1996. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in the Proceedings of CONCUR '93, LNCS 715.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....proof techniques. In Section 3, we discuss our up to injective substitutions, up to restriction and up to parallel composition proof methods; Section 4 is devoted to the description of a prototype implementation 1 The Mobility WorkBench exploits the axiomatisation of open bisimulation [San96b], since it also needs to stay at the level of syntax, because of the ion the AEyj method. 2 of these algorithms, and illustrates the capacities of our system on several examples. We nally conclude and discuss future extensions of this work. 1 Syntax This Section is devoted to the syntactical ....

....direction regarding the study of innite states processes, rather than as a challenger for these systems in terms of eOEciency. The notion of normal form appears in the literature through axiomatisations; axiomatisations of nite control processes have been given for example for open bisimulation [San96b] (this axiomatisation is used in the Mobility WorkBench) as well as for the fusion calculus [PV98] that is a promising language for the task of the implementation of verication methods. For replicated terms in the general case, EG96] proves decidability for an extended version of structural ....

D. Sangiorgi. A theory of bisimulation for the -calculus. Acta Informatica, 33:6997, 1996. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in the Proceedings of CONCUR '93, LNCS 715. 23

.... is a host of work on the calculus following the original presentation [MPW92] We here only mention that inspiration for the present paper comes from Milner s encoding of the calculus [Mil92] the axiomatizations by Parrow and Sangiorgi [PS95] and Sangiorgi s open bisimulation equivalence [San96b]. Milner s action calculi [Mil96] also aim to find a conceptually more fundamental formalism, though in a different direction. Future work: Using the fusion calculus to encode the fl calculus [Smo94, VP96] we should get a simple model which can be used to relate mobile processes to concurrent ....

....16:35 10 reaching agents which are again bisimilar. In calculi where transitions can contain placeholders (such as variables) for values, care has been taken to properly define what again bisimilar means. For example, in the calculus there are varieties such as early, late [MPW92] and open [San96b] bisimulation. These differ in the use of universal quantification over the names, and each leads to a different congruence. In the fusion calculus this diversity is mercifully absent; there appears to be only one sensible bisimulation congruence. The reason is that the fusion actions allow us to ....

[Article contains additional citation context not shown here]

D. Sangiorgi. A theory of bisimulation for the -calculus. Acta Informatica, 33:69--97, 1996. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in the Proceedings of CONCUR '93, LNCS 715.

.... power, as witnessed by its use in, e.g. the semantics of the programming language PICT [PRT93] and of object oriented programming [Wal95] it can naturally encode higher order communications [San92] and the calculus [Mil92] There is a variety of proof methods based on bisimulations [MPW92, San96, San92, San95, PS96] rewrite systems [PS95] and model checking [Dam93, AD96] and automated tools for these are emerging [VM94, FMQ95] An example calculus reduction is the following interaction: b(x) P j bhai : Q Gamma Pfa=xg j Q: Here b(x) P is an input which receives something for ....

D. Sangiorgi. A theory of bisimulation for the -calculus. Acta Informatica, 33:69--97, 1996. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in LNCS 715 (Proc. CONCUR'93).

....and output occurring on the same name. Most complications stem from stability of equivalence under global renamings, because renamings can create new redexes. In the synchronous calculus, bisimulations are not stable under substitutions, unless it is directly taken as part of the definition [18]; in the asynchronous calculus, the property holds because silent steps can always be split in two opposite transitions. In the joincalculus, global renamings may create new reductions only by substituting extruded variables for free variables, which cannot occur for regular (non open) ....

Davide Sangiorgi. A theory of bisimulation for the ß-calculus. Acta Informatica, 33:69--97, 1996. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in LNCS 715 (Proc. CONCUR'93).

....entails a substitution of the output object for the input object and adds a restriction for each name bound in the output object. The rule for replication simply says that P has the same transitions as ( P ) j P . We will use the open bisimulation equivalences originally proposed by Sangiorgi [San96]. A strong open bisimulation S is a binary relation on agents such that if PSQ then for every transition P ff Gamma P 0 (where the names bound in ff do not occur free in P or Q) there is a simulating transition Q ff Gamma Q 0 with P 0 SQ 0 and vice versa; moreover it must also hold ....

D. Sangiorgi. A theory of bisimulation for the ß-calculus. Acta Informatica, 33:69--97, 1996. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in LNCS 715 (Proc. CONCUR'93).

.... power, as witnessed by its use in, e.g. the semantics of the programming language PICT [PRT93] and of objectoriented programming [Wal95] it can naturally encode higher order communications [San92] and the calculus [Mil92] There is a variety of proof methods based on bisimulations [MPW92, San96, San92, San95, PS96] rewrite systems [PS95] and model checking [Dam93, AD96] and automated tools for these are emerging [VM94, FMQ95] An example calculus reduction is the following interaction: b(x) P j bhai : Q Gamma Pfa=xg j Q: Here b(x) P is an input which receives something for ....

D. Sangiorgi. A theory of bisimulation for the ß-calculus. Acta Informatica, 33:69--97, 1996. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in LNCS 715 (Proc. CONCUR'93).

No context found.

Davide Sangiorgi. A theory of bisimulation for the -calculus. Acta Informatica, 33:69-97, 1996. Earlier version published as Report ECS-LFCS-93-270, University of Edinburgh. An extended abstract appeared in the Proceedings of CONCUR '93, LNCS 715.

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