M/G/1-type Queue: Bursty arrivals Cox2 service

The above Markov chain is countinous time and the input of the tool should consist of matrixes that define its infinitesimal generator. The burst size in this example is 3. The order of the input matrices is showed in the following (the explanations on the right should not be included in the input file):

1	Size of boundary portion
2	Size of repetitive portion
3	Burst size of the process
0.000000000000001	Numerical accuracy
-3.5	Local transitions in boundary portion
10.0  12.0	Backward transitions to boundary portion
2.0    0.0	Forward transitions from boundary portion
1.0    0.0
0.5    0.0
10.0    0.0  12.0    0.0	Backward transitions in the repetitive portion
-17.5    4.0    0.0 -15.5	Local transitions in the repetitive portion
2.0    0.0   0.0    2.0	Forward transitions in the repetitive portion
1.0    0.0   0.0    1.0
0.5    0.0   0.0    0.5