By Topic

Deterministic λ-free Petri net languages and their application to the supervisory control of discrete event dynamic systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sreenivas, R.S. ; Dept. of Gen. Eng., Illinois Univ., Urbana, IL, USA

In this paper we introduce a family of languages called deterministic λ-free Petri net languages (DPNLs). We show that the controllability of a DPNL K⊆Σ* with respect to a DPNL L⊆Σ* is decidable. That is, it is possible to decide if (i) K⊆L, and (ii) KΣu∩L⊆K, where Σ=Σu∪Σc and Σu ∩Σc=φ. We also show that this family of languages strictly includes the family of Free-labeled Petri net languages (FLPNLs), another family of languages where the controllability of one language with respect to another is decidable

Published in:

Circuits and Systems, 1993., Proceedings of the 36th Midwest Symposium on

Date of Conference:

16-18 Aug 1993