Abstract
We show that the notion of uncontrollable marking commonly used in the literature on supervisory control theory of Petri nets is not sound, by means of a counter-example. We also show how the definition can be corrected and provide an adaptation of a decidability proof for the problem of checking controllability for specifications expressed as deterministic Petri net languages.
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
