Introduction
As a well-known mathematical modeling language, Petri Nets (PNs) [1–3] is a class of Discrete Event Dynamic Systems (DEDS). It is also widely applied to present and analyze most of the distributed systems [4–5]. Carl A. Petri firstly developed PN in 1962 [1–2], whom the theory of PN is named after. In this paper, we use PNs to simulate FMS and design a high-efficiency solution of system deadlocks. We also adopt Reachability Graph (RG) analysis to help finding out all reachable markings in FMS.