Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Bisimulations in general are a porful concept to minimize large finite state systems regarding some ll-defined observational behavior. In contrast to strong bisimulation, for branching bisimulation there are only tools available that work on an explicit state space representation. In this work,  present for the first time a symbolic approach for branching bisimulation that uses BDDs as basic data structure and that is based on the concept of signature refinement. First experimental results for problem instances derived from process algebraic system descriptions show the feasibility and the robustness of our approach
['Ralf Wimmer', 'Marc Herbstritt', 'Bernd Becker']
I am writing a research paper on a idea Minimization of Large State Spaces using Symbolic Branching Bisimulation
[{"from": "human", "value": "I am writing a research paper on a idea Minimization of Large State Spaces using Symbolic Branching Bisimulation"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Bisimulations in general are a porful concept to minimize large finite state systems regarding some ll-defined observational behavior. In contrast to strong bisimulation, for branching bisimulation there are only tools available that work on an explicit state space representation. In this work,  present for the first time a symbolic approach for branching bisimulation that uses BDDs as basic data structure and that is based on the concept of signature refinement. First experimental results for problem instances derived from process algebraic system descriptions show the feasibility and the robustness of our approach"}]