U. Montanari and M. Pistore. Checking bisimilarity for finitary -calculus. In Proc. CONCUR'95, volume 962 of LNCS. Springer Verlag, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Bisimulations in the Join-Calculus - Fournet, Laneve (1999) (1 citation) (Correct)
....to consider when comparing calculus processes. An alternative approach is to use typed interfaces and typed bisimulations in order to structure interaction with the environment [8] A more dynamic approach is to prune families of extraneous transitions from the synchronization tree. In [27] for instance, only transitions on active names are considered. 9 Conclusions In this paper, we have developed the theory of bisimulation for the joincalculus. We started from the initial definitions of [13] which are purely based on internal reductions and observational equivalence; we ....
.... its ground variant, is best suited for proofs, as it relies on smaller synchronization trees, but both labeled equivalences are much easier to check than barbed congruence, and should be amenable to automated verification by means of the existing algorithms (see, for instance, 35] and [27]) As regards the comparison between the calculus and the join calculus, there are fully abstract encodings up to barbed congruence [13] but these encodings are not fully abstract with respect to weak bisimulation. The reason is that firewalls used for protecting encodings from contexts after ....
Ugo Montanari and Marco Pistore. Checking bisimilarity for finitary - calculus. In Insup Lee and Scott A. Smolka, editors, Proceedings of the 6th International Conference on Concurrency Theory (CONCUR '95, Philadelphia), volume 962 of Lecture Notes in Computer Science, pages 42--56. SpringerVerlag, 1995.
Towards a Semantic-Based Verification Environment for the .. - Ferrari, Modoni, Quaglia (1995) (2 citations) (Correct)
....and tools for process verification have been developed and actually used in several applications (e.g. protocol verification) In the case of the calculus, the issues related to program verification are under investigation. Decidability results for calculus bisimulations were recently presented [Dam95, MP95] and the development of automated verification tools is at a beginning stage. The MWB (Mobility Workbench) VM94] is, to our knowledge, the only automated tool for the calculus. The basic functionality of the MWB is checking open bisimulation equivalence [San93] which is stronger than both late ....
....graphical interface is under development. The prototype version of the environment checks early and late bisimulations only for finite processes. The extension to suitable classes of infinite processes is being under investigation. One promising approach is to apply the techniques developed in [MP95] during the generation of the labelled transition system associated to processes by the jffi package. In [MP95] it is shown that for the class of finitary (processes where the degree of parallelism is bound) processes without matching early and late bisimulation equivalences can be decided by ....
[Article contains additional citation context not shown here]
U. Montanari, M. Pistore. Checking Bisimilarity for Finitary -calculus. In CONCUR '95, volume 962 of LNCS, Springer-Verlag, 1995.
History Dependent Automata - Montanari, Pistore (2001) (3 citations) Self-citation (Montanari Pistore) (Correct)
No context found.
U. Montanari and M. Pistore. Checking bisimilarity for finitary -calculus. In Proc. CONCUR'95, volume 962 of LNCS. Springer Verlag, 1995.
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