Petri Nets with Non-blocking Arcs are Difficult to Analyze
Jean-François Raskin, Laurent Van Begin · Electronic Notes in Theoretical Computer Science · 2004
In this paper, we study the decidability of five problems on a class of extended Petri nets. The study of this class of extended Petri nets is motivated by the problem of parametric verification of multiple copies of processes that can communicate with a partially non-blocking rendez-vous. This kind of communications occurs in abstractions of multi-threaded JAVA programs.