U. Montanari and M. Pistore. Checking bisimilarity for nitary -calculus. In Proc. CONCUR'95, LNCS 962. Springer Verlag, 1995  Home/Search   Document Not in Database   Summary   Related Articles   Check

....automaton corresponding to bisimilarity is the concrete representation of the nal coalgebra. Previous works on HD automata. Simpli ed versions of HD automata have been used in di erent papers to provide nite state representations of 5 di erent calculi with names: HD automata are applied in [20] to the calculus without matching, in [24] to CCS with localities, in [21] to Petri nets, and in [22] to a class of partial order systems. In [23] a family of HD automata is described that is rich enough to capture all the calculi above and the calculus with matching. Also, in that paper ....

U. Montanari and M. Pistore. Checking bisimilarity for nitary -calculus. In Proc. CONCUR'95, LNCS 962. Springer Verlag, 1995

....be captured by HD automata and some possible extensions, and we propose some concluding remarks. Previous works. This paper resumes and completes preliminary results on the HD automata that have been reported in previous papers by the authors. The rst, primitive notion of HD automata appears in [32] under the name of automata; they are used in an algorithm for checking bisimilarity of calculus agents without matching, as a compact algorithmical structure for representing the operational semantics of the agents. There was no notion of bisimulation on the automata. Simpli ed versions of ....

U. Montanari and M. Pistore. Checking bisimilarity for nitary -calculus. In Proc. CONCUR'95, LNCS 962. 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