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 is presented. A structural analysis of LSFC nets is presented. >
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
