For more information about this meeting, contact Jason Morton.
|Title:||Some open questions and results in discrete event control|
|Seminar:||Applied Algebra and Network Theory Seminar|
|Speaker:||Christopher Griffin, ARL/Penn State|
|Discrete event control is the application of formal language theory to the problem of controlling systems best described through events, rather than differential or difference equations. It is similar in spirit (though not in mathematics) to symbolic dynamical systems. In this context, controllability and observability predicates can be formulated. These formulations occur on languages defined over a free monoid $\Sigma^*$. In this talk, we will introduce the basic results from classical discrete event control and discuss newer results on decidability of the controllability and observability predicates on classes of languages generated by infinite memory systems. Open questions will be discussed.|
Room Reservation Information
|Date:||09 / 21 / 2011|
|Time:||02:30pm - 03:20pm|