Using trace theory to model discrete events
In this paper discrete processes are defined by means of trace structures. Every symbol in a trace denotes (the occurrence of) some discrete event. The trace alphabet is split into two disjoint sets, one denoting the communication events, the other denoting the exogenous events. Control of a discrete process means constructing a second discrete process having as alphabet the communication events only, so that the connection of the two discrete processes results in a desired exogenous trace set. Connection of discrete processes means blending of the corresponding trace structures.
An algorithm is derived to construct a controller, given a process to be controlled and specifications of the desired exogenous behavior.
Two examples of the use of this algorithm are presented.
KeywordsDiscrete Event Communication Event Discrete Process Exogenous Event Trace Theory
Unable to display preview. Download preview PDF.
- [JvdS]J.L.A. van de Snepscheut (1985) Trace theory and VLSI design (Lecture notes in computer science, nr. 200), Springer VerlagGoogle Scholar
- [HoUl]J.E. Hopcroft and J.D. Ullman (1979) Introduction to automata theory, languages and computation, Addision WesleyGoogle Scholar
- [RaWo]P.J. Ramadge and W.M. Wonham (1985) Supervisory control of a class of discrete event processes, systems control group report 8515, Dept. of electl. engrg., univ. of TorontoGoogle Scholar