A controllability condition of a siphon composed of three elementary ones in a class of Petri nets, namely S 3 PR, is developed. Under the condition, a maximally permissive liveness-enforcing supervisor expressed by a set of monitors (control places) can be decided by an algorithm with polynomial complexity for an S 3 PR if every dependent siphon is m -composed with m ≤ 3.

Full Text

Published Version
Open DOI Link

Get access to 115M+ research papers

Discover from 40M+ Open access, 2M+ Pre-prints, 9.5M Topics and 32K+ Journals.

Sign Up Now! It's 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