Showing papers by "W. M. Wonham published in 2007"
TL;DR: A new synthesis approach to the supervisory control of timed discrete event systems (TDES), that is more efficient than the existing approaches, and exploits binary decision diagrams (BDDs), adapted to the specific structure of TDES.
19 citations
01 Apr 2007
TL;DR: In this work, communicating processes of embedded components are modeled and controlled as Discrete-Event Systems (DES) and control logic among communicating components is derived by Supervisory Control Theory (SCT), so as to guarantee that the communicating processes meet all predefined constraints and possess other desirable system behavioral properties.
Abstract: A Communicating Transaction Process (CTP) is a computational model that serves as a high level specification language for reactive embedded system components and their interactions. It consists of a network of communicating processes coordinating their behaviors via common actions and the common actions are refined as a set of guarded Message Sequence Charts (MSCs). There has been little work devoted to developing CTP models systematically. This paper takes the first step towards bridging this gap. In our work, communicating processes of embedded components are modeled and controlled as Discrete-Event Systems (DES). The control logic among communicating components is derived by Supervisory Control Theory (SCT), so as to guarantee that the communicating processes meet all predefined constraints and possess other desirable system behavioral properties. The control logic is then translated into propositional formulas for guarded MSCs which then results in a CTP model with guaranteed behavioral properties.
18 citations
09 Jul 2007
TL;DR: This paper proposes an algorithm which can significantly reduce the state size of the supervisor while preserving its control action.
Abstract: In supervisory control of Timed Discrete-Event Systems (TDES) the supremal controller (representing the supremal controllable sublanguage) typically has a (large) state size of order the product of state size of the plant and specification automata. In this paper we propose an algorithm which can significantly reduce the state size of the supervisor while preserving its control action.
4 citations
01 Dec 2007
TL;DR: By use of a new modeling tool, the control-flow net, several intuitive systemic properties are formalized and identified when they are applicable and it is often possible to derive transparent and robust control logic for optimal nonblocking supervisory control, without recourse to brute-force computation.
Abstract: A well known obstruction to design based on supervisory control theory (SCT) is exponential state space explosion. Heuristics derived from system interconnection relationships may, however, prove effective in mitigating design complexity. By use of a new modeling tool, the control-flow net, we formalize several intuitive systemic properties and identify when they are applicable. On this basis it is often possible to derive transparent and robust control logic for optimal nonblocking supervisory control, without recourse to brute-force computation.
3 citations