Abstract
Coalgebra is used to generalize notions and techniques from concurrency theory in order to apply them to problems concerning the supervisory control of discrete event systems. The main ingredients of this approach are the characterization of controllability in terms of (a variant of) the notion of bisimulation, and the observation that the family of (partial) languages carries a final coalgebra structure. This allows for a pervasive use of coinductive definition and proof principles, leading to a conceptual unification and simplification and, in a number of cases, to more general and possibly more efficient algorithms. Note: This is an extended abstract of Technical Report SEN-R9921, CWI, available at http://www.cwi.nl/~janr, which contains proofs and many more examples.
This is a preview of subscription content, log in via an institution to check access.
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
P. Aczel. Non-well-founded sets. Number 14 in CSLI Lecture Notes, 1988.
P. Aczel and N. Mendler. A final coalgebra theorem. In LNCS 389, 1989.
G. Barrett and S. Lafortune. Bisimulation, the supervisory control problem and strong model matching for finite state machines. Discrete Event Dynamic Systems, 8:377–429, 1998.
R. Milner. A Calculus of Communicating Systems, LNCS 92, 1980.
D.M.R. Park. Concurrency and automata on infinite sequences. In LNCS 104, 1981.
J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Report CS-R9652, CWI, 1996. To appear in TCS.
J.J.M.M. Rutten. Automata and coinduction (an exercise in coalgebra). In CONCUR 1998.
J.J.M.M. Rutten. Coalgebra, concurrency, and control. Report SEN-R9921, CWI, 1999.
P.J.G. Ramadge and W.M. Wonham. The control of discrete event systems. Proc. IEEE, 77:81–98, 1989.
W.M. Wonham. Notes on control of discrete-event systems, 1999.
W.M. Wonham and P.J. Ramadge. On the supremal controllable sublanguage of a given language. SIAM J. Control and Optimization, 25(3):637–659, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Rutten, J.J.M.M. (2000). Coalgebra, Concurrency, and Control. In: Boel, R., Stremersch, G. (eds) Discrete Event Systems. The Springer International Series in Engineering and Computer Science, vol 569. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4493-7_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4493-7_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7025-3
Online ISBN: 978-1-4615-4493-7
eBook Packages: Springer Book Archive