Asynchronous logic : conversion of Petri nets to burst mode machines
HJ Hans Bogaards · TU/e Research Portal · 1999
There are two major ways of describing Asynchronous Control Systems: Petri Nets and Asynchronous Burst Mode Finite State Machines.A problem with Petri Nets is that they are not straight forward to synthesize.ABMFSMs are easier to synthesize.The goal of this paper is to describe a way to convert Petri Nets to ABMFSMs.The method presented here creates one Burst Mode Machine for every output of the original Signal Transition Graph, a sub-class of Petri Nets.Automatic conversion is done by means of a C-program.This program can convert many STGs to ABMFSMs, but when the STG contains concurrency (two signals that can change at the same time) it has limitations.Appendix A Source code of stg2burst.hB Source code of stg2proto.h