Problem with the symbolic representation Consider the processes built from the sequences t1(  1).t3(  3) and t1(  1).t2(  2).t3(  3) Constraints on t3 are: –[  1≤2]  [  3=  1+2](first case) –[  1≤2]  [1≤  2≤2]  [  2≤  1+2]  [  3=  1+2]  [  3≤max(  1,  2)] The superimposition will provide a disjunction, which will make difficult the extraction of processes in the general case Except for the particular case of Time Extended Free Choice Nets
{}