This project aims at studying logical and timed discrete event systems using methods from universal coalgebra and idempotent algebra with special focus on supervisory control of large distributed systems. Methods of idempotent algebra enable linear representation on suitable idempotent semirings useful for quantitative (timing) aspect of control, while coalgebra is useful for qualitative aspects of control. A combination of these techniques will be applied to the decentralized and modular supervisory control in order to reduce the computational complexity and make our results applicable to control of large distributed systems.
Main investigator:
Participating institutions:
Institute of Mathematics, AS CR
