PDF hosted at the Radboud Repository of the Radboud University NijmegenJanuary 23rd, 2018
FiledJanuary 23rd, 2018Fig. 4. Splitting graph for the suspension automaton of Fig. 1 (left), where we shorten all CCS expressions 0+F to F , and an adaptive distinguishing graph for the suspension automaton of Fig. 1 (right), annotated with current state sets P , as used in Algorithm 4.