A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
The behavior of timed DES can be described by sequences of event occurrence times. These sequences can be ordered to form a lattice. Since logical (untimed) DES behaviors described by regular languages also form a lattice, questions of controllability for timed DES may be treated in much the same manner as they are for untimed systems. In this paper we establish conditions for the controllability of timed DES performance speci cation which are expressed as inequations on the lattice. Thsesdoi:10.1109/9.481519 fatcat:7icyhkk4e5g6dh2zrzc4arv23e