Factorization-Based Approach for Computing a Minimum Makespan Controllable Sublanguage

Abstract

This paper proposes a decomposition-based approach for computing a controllable sublanguage with minimum makespan. It is applicable to a class of cyclic discrete event system modeled by cyclic timed automata. We introduce the notion of the symmetrically reachable idle state and show that its existence in an automaton allows to decompose a language into a concatenation of smaller languages. We also propose a new technique to compute the makespan of finite length strings. Results are illustrated with a case study of a small factory.