Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Lecture Notes in Computer Science;J. Baeten,1987
2. Lecture Notes in Computer Science;O. Burkart,1995
3. Lecture Notes in Computer Science;O. Burkart,1996
4. Balcazar, J., Gabarro, J., Santha, M.: Deciding bisimilarity is p-complete. Formal Aspects of Computing 4, 638–648 (1992)
5. Lecture Notes in Computer Science;W. Czerwiński,2011
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Uniform Random Process Model Revisited;Programming Languages and Systems;2019
2. Branching Bisimilarity Checking for PRS;Automata, Languages, and Programming;2014