Abstract
Discrete event systems can be modelled using a trace theory based setting. A control problem similar to the one in supervisory control theory can be formulated and easily solved using a special operator, the reflection. Using state graphs the solution can be computed effectively. Moreover, a subsystem of the controller can be computed such that the connection of plant and controller is free of lock.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.L.A. van de Snepscheut. Trace theory and VLSI design. Lecture notes in computer science, nr. 200. Springer Verlag, 1985.
R. Smedinga. Locked discrete event systems. Technical Report CS9002, Department of computing science, University of Groningen, 1990.
R. Smedinga. The reflection operator in discrete event systems. Technical Report CS9201, Department of computing science, University of Groningen, 1992.
R. Smedinga. Discrete event systems. course-notes, Department of computing science, University of Groningen, 1992.
S. Balemi. Control of discrete event systems: theory and application. PhD thesis, Swiss federal institute of technology, ZĂĽrich, May 1992.
P.J. Ramadge and W.M. Wonham. Supervisory control of a class of discrete event processes. SIAM journal on Control and optimalisation,25 (1), 1987. See also: systems control group report 8515, department of electrical engineering, University of Toronto.
P.J. Ramadge and W.M. Wonham. The control of discrete event systems. Proceedings of the IEEE, 77 (1), 1989.
T.Verhoeff. Factorization in process domains. Technical Report 91/03, department of mathematics and computing science, Eindhoven university of technology, 1991.
R. Smedinga. Discrete event systems: deadlock, livelock, and livedeadlock. In U. Jaaksoo and V.I. Utkin, editors, Automatic Control, world congress 1990, 13–17 August, proceedings of 11th IFAC world congress, volume I II, Tallinn, Estonia, USSR, 1991. Pergamon Press.
R. Smedinga. An effective way to undo a discrete event system of its (dead)lock. In Preprints of proceedings of the IFAC Symposium on Design Methods for Control Systems, Zürich, Switzerland, 4–6 Sep. 1991.
R. Smedinga. Locked discrete event systems: how to model and how to unlock. submitted to the journal of Discrete Event Dynamical Systems, 1992.
R. Smedinga. The workshop exercise using a trace theory based setting. In this volume, pages 167–172.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Birkhäuser Verlag Basel
About this chapter
Cite this chapter
Smedinga, R. (1993). An Overview of Results in Discrete Event Systems Using a Trace Theory Based Setting. In: Balemi, S., Kozák, P., Smedinga, R. (eds) Discrete Event Systems: Modeling and Control. Progress in Systems and Control Theory, vol 13. Birkhäuser Basel. https://doi.org/10.1007/978-3-0348-9120-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-0348-9120-2_4
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-0348-9916-1
Online ISBN: 978-3-0348-9120-2
eBook Packages: Springer Book Archive