Parsing of probabilistic LTS is broken
For example, the FSP below breaks.
A = ( (1) a -> A
| (1) b -> A
).
B = ( (1) b -> B
| (2) c -> B
).
||SYS = ( A || B ).
For example, the FSP below breaks.
A = ( (1) a -> A
| (1) b -> A
).
B = ( (1) b -> B
| (2) c -> B
).
||SYS = ( A || B ).