H. Lin. Complete inference systems for weak bisimulation equivalences in the #-calculus. Journal of Information and Computation, 180(1):1--29, 2003.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Weijland (1996) for these congruences (in the case of weak bisimulation, these are Milner s original # laws) are su#cient to prove that each process expression is equal to one that is included in such a subset. Consequently, the resulting axiomatisations are complete. Hennessy and Lin (1996) and Lin (1995) provided complete axiomatisations for extensions of message passing process algebras and the # calculus with the silent step in weak bisimulation semantics. In both settings it su#ces to add Milner s # laws to the axiomatisations of strong bisimulation. These languages include a restricted form ....

Lin, H. (1995). Complete inference systems for weak bisimulation equivalences in the #-calculus. In P. D. Mosses, M. Nielsen, and M. I. Swarzbach, editors, Proceedings of TAPSOFT'95 , volume 915 of Lecture Notes in Computer Science, pages 187--201. Springer.

....no parameter. 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 ....

Lin, H. (1995). Complete inference systems for weak bisimulation equivalences in the -calculus. In P. D. Mosses, M. Nielsen, and M. I. Swarzbach, editors, Proceedings of TAPSOFT'95 , volume 915 of Lecture Notes in Computer Science, pages 187--201. Springer.

.... virtue of standard results, the axiomatizations of other forgetting equivalences can be straightforwardly got (e.g. Dynamic [MS92] and Branching [vGW89] both Early and Late) Up to date, the Weak Late calculus bisimulation was only axiomatized relying on the notion of Symbolic bisimulation [Lin95], whose relationship with Branching and Dynamic equivalence is still not investigated. Finally, as during the execution of finite processes only finitely many names are considered, our approach allows calculus processes to be modelled by finitely branching labelled trees. This peculiarity, ....

....axiomatizations of the Branching and of the Dynamic bisimulations can be gotten by simply removing from the axiom system Aw the equation (T 3) and the equation (T 1) respectively. Up to date, the Weak Late calculus bisimulation was only axiomatized relying on the notion of Symbolic bisimulation [Lin95]. The Symbolic bisimulation is usually got as closure on top of a family of indexed bisimulation relations [HL93] To our knowledge, no result is available in that setting about the Branching and the Dynamic equivalence. ....

H. Lin. Complete Inference Systems for Weak Bisimulation Equivalences in the -Calculus. To appear in the Proc. of TAPSOFT '95, 1995.

....which the running process is considered to depend on. Analogous instantition strategies are a common feature of symbolic semantics for data dependent calculi [HL95] Indeed, a call byneed discipline underlies the alternative characterizations of late and open calculus semantics presented in [Lin95, Lin94] and [San96] respectively. The relationship between their approach and the one proposed here deserves further investigation. What is immediately evident is the difference at the extensional level. Symbolic semantics is defined as closure over a family of bisimulation relations indexed by ....

H. Lin. Complete Inference Systems for Weak Bisimulation Equivalences in the -Calculus. In P.D. Mosses, M. Nielsen, and M.I. Schwartzbach, editors, Proc. 6th International Joint Conference CAAP/FASE, TAPSOFT '95, volume 915 of LNCS. Springer-Verlag, 1995.

....the calculus. In the current prototype version, the environment provides two main facilities: a calculus interpreter equipped with a graphical interface, and a verification tool which is used to decide (strong and weak) early and late bisimulation equivalences [MPW92, MPW93, Mil90] see also [FMQ94, FMQ95, Lin95]) for finite calculus processes. The environment is built on top of the JACK system [BGL94] which integrates several specification and verification tools into a single environment. In the JACK system the integration among the various tools is obtained by exploiting the FC2 format [MS93] which ....

H. Lin. Complete Inference Systems for Weak Bisimulation Equivalences in the -Calculus. In TAPSOFT'95, volume 915 of LNCS, SpringerVerlag, 1995.

....the infancy of this calculus. Di erent bisimulation equivalences in the recursion free subset of the calculus have been successfully axiomatised: late ground bisimulation [9] late early strong bisimulation congruences [10, 1, 4] open bisimulation [11] late early weak bisimulation congruences [5]; styles of proof systems have been exploited: equational axiomatisation [10, 11] and symbolic inference systems [1, 4, 5] To deal with recursion, 6] proposed a version of Unique xpoint induction, thus obtained complete proof systems for both late and early strong bisimulation congruence in ....

.... been successfully axiomatised: late ground bisimulation [9] late early strong bisimulation congruences [10, 1, 4] open bisimulation [11] late early weak bisimulation congruences [5] styles of proof systems have been exploited: equational axiomatisation [10, 11] and symbolic inference systems [1, 4, 5]. To deal with recursion, 6] proposed a version of Unique xpoint induction, thus obtained complete proof systems for both late and early strong bisimulation congruence in nite control calculus with guarded recursions. The main contributions of the present paper are: 1) Presenting proof ....

[Article contains additional citation context not shown here]

H. Lin. Complete inference systems for weak bisimulation equivalences in the -calculus. In TAPSOFT'95, LNCS 915. Springer{Verlag, 1995.

....for regular pure CCS. It is shown that the proof systems are sound, and also complete when restricted to the subset of calculus where recursions are guarded and the parallel composition is disallowed. These results on the one hand extend the proof systems for recursion free calculus in [Lin94, Lin95] to in nite processes, on the other hand extend the inference system for guarded regular pure CCS of [Mil84] to calculus. 1 Introduction There has been growing interest in providing sound and complete proof systems for the calculus. Various notions of equivalences have been axiomatised: ....

....There has been growing interest in providing sound and complete proof systems for the calculus. Various notions of equivalences have been axiomatised: late and early strong bisimulation congruence [PS93, BD94, Lin94] open bisimulation [San93] late and early weak bisimulation equivalences [Lin95], and testing equivalences [Hen91, BD92] Di erent styles of proof systems have been used: equational axiomatisation [PS93, San93] and symbolic inference systems [BD94, Lin94, Lin95] All these proof systems are only for recursion free calculus in which processes can perform only a nite number ....

[Article contains additional citation context not shown here]

H. Lin. Complete inference systems for weak bisimulation equivalences in the -calculus. In Proceedings of Sixth International Joint Conference on the Theory and Practice of Software Development, Lecture Notes in Computer Science. Springer{Verlag, 1995.

....be further compared after matching input actions (one for each possible instantiation of the input names) rendering any computation directly based on the de nition ine ective. To overcome this in nite branching problem the notion of symbolic bisimulation has been proposed for the calculus [Lin94, Lin95a]. It was adapted from the work on symbolic bisimulation for general value passing processes [HL95, HL96] A symbolic bisimulation is a family of binary relations over processes, indexed by conditions (boolean combinations of equality tests over nite sets of names) Instead of instantiating an ....

....for each 2 MCE fn(t;u) fzg ( t . a fresh name z 62 fn(t; u) t [f z 6=wjw2fn( t ; u ) g . Write t L u if (t; u) 2 S 2 S for some late symbolic bisimulation S. 2 The above de nition di ers from the usual de nition of symbolic bisimulation (as in [Lin95a, Lin95b], say) in that here it is required each indexing condition be maximally consistent. The di erence is only super cial. Let be the symbolic bisimulation relation as de ned in [Lin95a, Lin95b] then it can easily be shown that t u if and only if t L u for every 2 MCE fn(t;u) L ....

[Article contains additional citation context not shown here]

H. Lin. Complete inference systems for weak bisimulation equivalences in the - calculus. In TAPSOFT'95, volume 915 of Lecture Notes in Computer Science. Springer{Verlag, 1995.

No context found.

H. Lin. Complete inference systems for weak bisimulation equivalences in the #-calculus. Journal of Information and Computation, 180(1):1--29, 2003.

No context found.

H. Lin. Complete inference systems for weak bisimulation equivalences in the #-calculus. Journal of Information and Computation, 180(1):1--29, 2003.

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