Determinate STG Decomposition of Marked Graphs

@inproceedings{Schfer2005DeterminateSD,
  title={Determinate STG Decomposition of Marked Graphs},
  author={Mark Sch{\"a}fer and Walter Vogler and Petr Jancar},
  booktitle={ICATPN},
  year={2005}
}
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondeterministic algorithm for decomposing STGs was suggested by Chu and improved by one of the present authors. To find the best possible result the algorithm might produce, it would be important to know to what extent nondeterminism influences the result, i.e. to what extent the algorithm is determinate. The result of the… CONTINUE READING