@InProceedings{ wimmer-et-al-ddecs-2006,
  title =     "Minimization of Large State Spaces 
               using Symbolic Branching Bisimulation",
  author =    "Ralf Wimmer and Marc Herbstritt and Bernd Becker",
  booktitle = "Proceedings of the 9\textsuperscript{th} IEEE Workshop on Design \& 
               Diagnostics of Electronic Circuits \& Systems (DDECS)",
  month =     april,
  year =      "2006",
  address =   "Prague",
  pages =     "9--14",
  publisher = "IEEE Computer Society Press",
  isbn =      "1-4244-0184-4",
  editor =    "Matteo Sonza Reorda and Ond\v{r}ej Nov\'{a}k and Bernd Staube and 
               Hana Kub\'{a}tov\'{a} and Zden\v{e}k Kot\'{a}sek nad
	       Pavel Kubal\'\i{}k and Raimund Ubar and Ji\v{r}\'{\i} Bucek",
  abstract =  "Bisimulations in general are a powerful concept to minimize large 
               finite state systems regarding some well-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 we 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."
}