Author:
Christensen Søren,Hirshfeld Yoram,Moller Faron
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. J.C.M. Baeten, J.A. Bergstra and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE 87, J.W. de Bakker, A.J. Nijman, P.C. Treleaven (eds), Lecture Notes in Computer Science 259, pp93–114. Springer-Verlag, 1987.
2. I. Castellani. Bisimulations for Concurrency. PhD thesis CST-51-88. University of Edinburgh, 1988.
3. D. Caucal. Graphes canoniques des graphes algébriques. Informatique Théorique et Applications (RAIRO) 24(4), pp339–352, 1990.
4. S. Christensen. Distributed bisimilarity is decidable for a class of infinite-state systems. In Proceedings of CONCUR 92, W.R. Cleaveland (ed), Lecture Notes in Computer Science 630, pp148–161. Springer-Verlag, 1992.
5. S. Christensen. Forthcoming PhD thesis. University of Edinburgh, 1993.
Cited by
69 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献