Binary Information Press
Colored Petri-Nets (CPNs) is now in widespread use for concurrent systems. However, some structural properties studied in the place/transition nets domain, like generative families of invariants, remain difficult to extend to CPN. Thus, transforming the CPN is of interest. The authors propose in this paper a pragmatic approach with formulated rules that states how to transform the CPN models into equivalent place/transition nets. In the paper, the syntax of the token elements and arc expressions described by CPN meta-language are classified and then parsed. Specific transformation rules are sequentially formulated with taking the incidence matrix as middleware.