Abstract
AbstractThis chapter first introduces the basic concepts and two kinds of semantics of elementary net systems. Then two kinds of methods on representing and analysing their dynamic behaviours are presented, i.e., the reachability graph method over the interleaving semantics and the unfolding method over the concurrent semantics. In this chapter, some basic properties such as reachability, coverability, deadlock, liveness, and persistence are involved, and the computational complexity of determining them are also introduced briefly.
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
