@techreport{TR-IC-14-15,
   number = {IC-14-15},
   author = {Adilson Luiz Bonifacio and Arnaldo Vieira Moura},
   title = {Intrinsic Properties of Complete Test Suites},
   month = {September},
   year = {2014},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 15 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       One desirable property of test suites is completeness. Roughly,
       completeness  guarantees  that  non-equivalent  implementations 
       under  test  will  always  be  identified.  Several  approaches 
       proposed  sufficient,  and sometimes also necessary, conditions
       on  the  specification  model and on the test suite in order to
       guarantee   completeness.   Usually,  these  approaches  impose 
       several   restrictions   on   the   specification  and  on  the 
       implementations,  such  as  requiring  them  to  be  reduced or
       complete.  Further,  test cases are required to be non-blocking
       on  both the specification and the implementation. In this work
       we  deal with the more general scenario where test cases can be
       blocking.  We propose a new notion of equivalence, define a new
       notion  that  captures  completeness,  and move to characterize
       test  suite  completeness in this new scenario. A related issue
       that   concerns   test   suite  completeness  is  the  size  of 
       implementations  under  test.  Usually, earlier works constrain
       implementations  to  have  at most the same number of states as
       the  given  specification.  We  establish an upper bound on the
       number  of  states of the implementations beyond which the test
       suite will not be complete, in the classical sense.
  }
}