Reachability of LSFC nets
D.-I. Lee, Satoshi Kumagai, Shinzo Kodama · 2002
Free choice nets are a class of Petri nets that can represent the substantial features of systems by modeling both choice and concurrency. A reachability problem of live and safe free choice (LSFC) nets is considered. A necessary and sufficient condition for the reachability of a class of LSFC nets is presented. A structural analysis of LSFC nets is presented.>