Abstract: We present a way to lift up the Tower complexity lower bound of the reachability problem for Petri nets to match the Ackermannian upper bound closing a long standing open problem. We also ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback