For the most recent entries see the Petri Nets Newsletter.

Reachability of LSFC Nets.

Dong, Ik Lee; Kumagai, Sadatoshi; Kodama, Shinzo

In: Proceedings of the IEEE International Symposium on Circuits and Systems, 1990, New Orleans, LA, USA; Part 4, pages 2666-2669. Piscataway, NJ, USA: IEEE Service Center, 1990.

Abstract: 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 and a structural analysis of LSFC nets is presented.

Keywords: live (and) safe free choice net, reachability (and) analysis.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography