Are classical Petri nets adequate to represent the problem where the number of readers is unbounded? Show a solution to this problem using as few inhibitor arcs as possible. Refine this solution and...

Are classical Petri nets adequate to represent the problem where the number of readers is unbounded? Show a solution to this problem using as few inhibitor arcs as possible. Refine this solution and the one in Exercise 12.1 to implement the policy that as soon as a writer becomes ready to write, no more readers are allowed to start reading. Is this refinement dependent on whether the number of readers is finite or unbounded?