An Equivalent CTL Formulation for Condition Sequences
Discrete Event Dynamic Systems
Modal Specifications for the Control Theory of Discrete Event Systems
Discrete Event Dynamic Systems
SoC design approach using convertibility verification
EURASIP Journal on Embedded Systems - Model-driven high-level programming of embedded systems: selected papers from SLA++P'07 and SLA++P'08
Behavior based service composition
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Modeling for safety in a synthesis-centric systems engineering framework
SAFECOMP'12 Proceedings of the 2012 international conference on Computer Safety, Reliability, and Security
Concurrency control generation for dynamic threads using discrete-event systems
Science of Computer Programming
| Hi-index | 0.00 |
The supervisory control problem of discrete event systems with temporal logic specifications is studied. The full branching time logic of CTL* is used for expressing specifications of discrete event systems. The control problem of CTL* is reduced to the decision problem of CTL*. A small model theorem for the control of CTL* is obtained. It is shown that the control problem of CTL* (resp., CTL) is complete for deterministic double (resp., single) exponential time. A sound and complete supervisor synthesis algorithm for the control of CTL* is provided. Special cases of the control of computation tree logic (CTL) and linear-time temporal logic are also studied.