String execution time for finite languages: Max is easy, min is hard

In performance evaluation or supervisory control, we often encounter problems of determining the maximum or minimum string execution time for a finite language when estimating the worst-case or best-case performance. It has been shown in the literature that the time complexity for computing the maximum string execution time for a finite language is polynomial with respect to the size of an automaton recognizer of that language and the dimension of the corresponding resource matrices. In this paper we provide a more efficient algorithm to compute such maximum string execution time. Then we show that it is NP-complete to determine the minimum string execution time.

[1]  Jean-Louis Boimond,et al.  Supervisory Control of (max,+) Automata: A Behavioral Approach , 2009, Discret. Event Dyn. Syst..

[2]  Jean Mairesse,et al.  Task resource models and max-plus automata , 1998 .

[3]  G. Viennot.  Heaps of Pieces, I: Basic Definitions and Combinatorial Lemmas , 1989 .

[4]  J. Boimond,et al.  Control of (max,+) automata: Logical and timing aspects , 2008, 2008 9th International Workshop on Discrete Event Systems.

[5]  Rong Su,et al.  The Synthesis of Time Optimal Supervisors by Using Heaps-of-Pieces , 2012, IEEE Transactions on Automatic Control.

[6]  P. Ramadge,et al.  On the supremal controllable sublanguage of a given language , 1984, The 23rd IEEE Conference on Decision and Control.

[7]  J. Orlin.  Contentment in graph theory: Covering graphs with cliques , 1977 .

[8]  Zhiwu Li,et al.  ON SUPERVISORY CONTROL OF A CLASS OF DISCRETE EVENT SYSTEMS , 2006 .

[9]  P. Ramadge,et al.  On the supermal controllable sublanguage of a given language , 1987 .

[10]  J. Mairesse,et al.  Idempotency: Task resource models and (max, +) automata , 1998 .

[11]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[12]  S. Gaubert.  Performance evaluation of (max, +) automata , 1995, IEEE Trans. Autom. Control..

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  J. Quadrat,et al.  Max-Plus Algebra and System Theory: Where We Are and Where to Go Now , 1999 .