A comparison of two analysis algorithms for fuzzy marking Petri nets

Fuzzy marking Petri Nets (FMPNs) were presented by the authors (1995) as an extension of Petri Nets in which markings are imprecise numbers represented by membership functions. In this paper, two analysis algorithms for the reachability analysis of FMPNs are presented and compared. A simple example of a FMPN is analyzed using the two algorithms.