A formal technique for the synthesis of Petri net supervisors for discrete event systems
A formal technique for the synthesis of Petri net supervisors for discrete event systems
- Author(s): A.H. Jones and M. Uzam
- DOI: 10.1049/cp:19980339
For access to this article, please select a purchase option:
Buy conference paper PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
UKACC International Conference on Control (CONTROL '98) — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): A.H. Jones and M. Uzam Source: UKACC International Conference on Control (CONTROL '98), 1998 p. 845 – 852
- Conference: UKACC International Conference on Control (CONTROL '98)
- DOI: 10.1049/cp:19980339
- ISBN: 0 85296 708 X
- Location: Swansea, UK
- Conference date: 1-4 Sept. 1998
- Format: PDF
In this paper a formal technique for the synthesis of Petri-net-based supervisors for discrete event systems is proposed to solve the forbidden state problem. The solution has close parallels to the finite state machine approach proposed by Ramadge and Wonham (1987, 1989). The technique thus provides a Petri net equivalent method to act as further stimulus to solving the synthesis of supervisory control problems. In this paper the methodology is explained in detail by considering a discrete manufacturing system.
Inspec keywords: discrete event systems; Petri nets; production control; formal specification
Subjects: Combinatorial mathematics; Production management; Discrete control systems; Systems theory applications; Combinatorial mathematics; Systems theory applications in industry
Related content
content/conferences/10.1049/cp_19980339
pub_keyword,iet_inspecKeyword,pub_concept
6
6
