Deterministic λ-free Petri net languages and their application to the supervisory control of Discrete Event Dynamic Systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 is contained in Σ* with respect to a DPNL L is contained in Σ* is decidable. That is, it is possible to decide if (i) K is contained in L, and (ii) the intersection of sets KΣu and L is contained in K, where Σc = where the union of sets where the union of sets σu and Σc and the intersection of sets Σu and Σc = 0. 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. Essentially this paper is an extension of reference.

Original languageEnglish (US)
Title of host publicationMidwest Symposium on Circuits and Systems
PublisherPubl by IEEE
Pages340-343
Number of pages4
ISBN (Print)0780317610
StatePublished - Dec 1 1993
EventProceedings of the 36th Midwest Symposium on Circuits and Systems - Detroit, MI, USA
Duration: Aug 16 1993Aug 18 1993

Publication series

NameMidwest Symposium on Circuits and Systems
Volume1

Other

OtherProceedings of the 36th Midwest Symposium on Circuits and Systems
CityDetroit, MI, USA
Period8/16/938/18/93

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Deterministic λ-free Petri net languages and their application to the supervisory control of Discrete Event Dynamic Systems'. Together they form a unique fingerprint.

Cite this