Contracts for modular discrete controller synthesis
Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems
| Hi-index | 0.00 |
This study proposes a method for constructing reliablecontrollers for arbitrarily large discrete systems. The controlleris synthesized by finding a winning strategy for specificgames defined by contracts. The discrete system modelis an action system, and the requirement is a temporal property.We use the extended action system notation that allowsboth angelic and demonic nondeterminism, such thatthe game reduces to a competition between the angel, thatis, the controller, and the demon, that is, the plant, whichtry to prevent each other from achieving their respectivegoals. If the synthesis is possible, that is, if the angel has away to enforce the required property, the process ends withfinding the winning strategy of the angel, by propagatingbackwards the computed precondition of the demon, withrespect to that property. This technique guarantees the correctnessof the derived program. We illustrate our methodon a producer-consumer application.