public static < I > boolean incrementalTransitionCover ( DeterministicAutomaton < ? , I , ? > automaton , Collection < ? extends I > inputs , Collection < ? extends Word < I > > oldTransCover , Collection < ? super Word < I > > newTransCover ) { final int oldTransSize = newTransCover . size ( ) ; incrementalCover ( automaton , inputs , Collections . emptySet ( ) , oldTransCover , w -> { } , newTransCover :: add ) ; return oldTransSize < newTransCover . size ( ) ; }
Computes an incremental transition cover for a given automaton i . e . a cover that only contains the missing sequences for obtaining a complete transition cover .