A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Petri nets with read arcs are investigated with respect to their unfolding, where read arcs model reading without consuming, which is often more adequate than the destructive-read-and-rewrite modelled with loops in ordinary nets. The paper rede nes the concepts of a branching process and unfolding for nets with read arcs and proves that the set of reachable markings of a net is completely represented by its unfolding. The speci c feature of branching processes of nets with read arcs is that thedoi:10.1007/bfb0055644 fatcat:74cby6izgbhnho2zw2wqfrxfoy