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

In this paper we introduce a family of languages called deterministic /spl lambda/-free Petri net languages (DPNLs). We show that the controllability of a DPNL K/spl subespl Sigma/* with respect to a DPNL L/spl subespl Sigma/* is decidable. That is, it is possible to decide if (i) K/spl sube/L, and (ii) K/spl Sigmasub uspl cap/L/spl sube/K, where /spl Sigma/=/spl Sigmasub uspl cupspl Sigmasub c/ and /spl Sigmasub uspl capspl Sigmasub c/=/spl phi/. 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.<
>