@techreport{TR-IC-13-33,
   number = {IC-13-33},
   author = {Adilson Luiz Bonifacio and Arnaldo Vieira Moura},
   title  =  {Partial  FSM  Models and Completeness with Blocking Test
                   Cases},
   month = {November},
   year = {2013},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 15 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       Test  suite  generation  and coverage analysis have been widely
       studied  for  FSM-based  models.  Several  studies  focused  on 
       specific  conditions for verifying completeness of test suites.
       Some   have   found   necessary   conditions   for  test  suite 
       completeness, whereas other approaches obtained sufficient, but
       not necessary, conditions for this problem. Most of these works
       restricted  the  specification or the implementation FSM models
       in several ways. More recent works have described necessary and
       sufficient  conditions  for  test  suite completeness, but only
       under  the  assumption that all implementations be complete FSM
       models.  In  this  work  we  describe  necessary and sufficient
       conditions  for  test  suite  completeness  under  more relaxed
       constraints.  We  also  show  an intrinsic relation between the
       number  of  states in implementations and complete test suites.
       Further  we  show  necessary and sufficient conditions for test
       suite  completeness  in  the  presence of blocking sequences in
       both the specification and the implementation models.
  }
}