The Supervisor Synthesis Problem for Unrestricted CTL is NP-complete

Request Use

Idle Request Use r1i1u1:c1r2u2:c2i2Idle M1M2

M1||M2

r1r1r1

u1:c1u1:c1u1:c1

r2

r2

r2u2:c2u2:c2u2:c2

i2

i2

i1

i1i2i1Use1,Use2

Idle1,Idle2Use2,Request1

Use1,Request2