Branching Processes of general S/T-Systems and their properties
Stefan Haar · Electronic Notes in Theoretical Computer Science · 1998
We introduce an alternative occurrence net semantics of S/T-systems which allows for arbitrary markings and arc weights. Our definition, a branching version of Vogler's [10] execution semantics, will work for general systems, including unbounded ones and arc weights greater than one. Also, the principles in constructing the unfolding are different, making the definition more general and, presumably, flexible to include future extensions to different net classes.