DocumentCode :
935668
Title :
On minimal representations of Petri net languages
Author :
Sreenivas, Ramavarapu S.
Author_Institution :
Dept. of Gen. Eng., Univ. of Illinois, Urbana, IL, USA
Volume :
51
Issue :
5
fYear :
2006
fDate :
5/1/2006 12:00:00 AM
Firstpage :
799
Lastpage :
804
Abstract :
Given a measure of size of a labeled Petri net, we consider the existence of a procedure that takes as input a description of an arbitrary, labeled Petri net, and returns a description of a (possibly different) labeled Petri net with the smallest size that generates the same language as the input. We refer to such procedures as minimization procedures. In this note, we investigate the existence of minimization procedures for a variety of measures. We show that these procedures cannot exist for Petri net languages for a large class of measures. However, for families of Petri net languages where controllability (cf. ), and consequently language-containment, is decidable , there can be minimization procedures for a restricted class of measures. After showing that minimization procedures for a family of measures are intractable for languages generated by bounded Petri nets, it is argued that a similar conclusion has to be reached for any family of Petri net languages that includes the family of regular languages for which there are minimization procedures.
Keywords :
Petri nets; finite state machines; formal languages; Petri net languages; controllability; finite state automata; language-containment; minimal representations; regular languages; Asynchronous transfer mode; Automata; Computer science; Control system synthesis; Control systems; Discrete event systems; Process control; Rivers; Software packages; Supervisory control; Discrete-event systems; Petri nets; supervisory control;
fLanguage :
English
Journal_Title :
Automatic Control, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9286
Type :
jour
DOI :
10.1109/TAC.2006.875026
Filename :
1632308
Link To Document :
بازگشت