LTS Termination Proof

by AProVE


Integer Transition System


1 Switch to Cooperation Termination Proof

We consider the following cutpoint-transitions:
l1 l1 l1: TRUE
l3 l3 l3: TRUE
l0 l0 l0: TRUE
l2 l2 l2: TRUE
and for every transition t, a duplicate t is considered.

2 SCC Decomposition

We consider subproblems for each of the 1 SCC(s) of the program graph.

2.1 SCC Subproblem 1/1

Here we consider the SCC { l1, l0 }.

2.1.1 Transition Removal

We remove transitions 1, 2 using the following ranking functions, which are bounded by −1.

l0: −1
l1: 0

2.1.2 Trivial Cooperation Program

There are no more "sharp" transitions in the cooperation program. Hence the cooperation termination is proved.

Tool configuration