Author:
Yin Qiang,Fu Yuxi,He Chaodong,Huang Mingzhang,Tao Xiuting
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Lecture Notes in Computer Science;J.C.M. Baeten,1987
2. Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on Infinite Structures. In: Handbook of Process Algebra. Elsevier Science (2001)
3. Lecture Notes in Computer Science;S. Christensen,1993
4. Lecture Notes in Computer Science;S. Christensen,1992
5. Lecture Notes in Computer Science;W. Czerwiński,2011
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Relating Apartness and Branching Bisimulation Games;Lecture Notes in Computer Science;2024
2. The parametric complexity of bisimulation equivalence of normed pushdown automata;Frontiers of Computer Science;2021-12-03
3. Parity game reductions;Acta Informatica;2017-08-04
4. Branching Bisimulation Games;Formal Techniques for Distributed Objects, Components, and Systems;2016
5. Bisimulation Equivalence of First-Order Grammars;Automata, Languages, and Programming;2014