会议专题

Computation for Supremal Simulation-Based Controllable and Strong Observable Subautomata

In our previous work, we proposed simulation-based controllability and simulation-based observability as properties of the specification to guarantee the existence of a bisimilarity supervisor. However, a given specification may not satisfy these conditions. Then, a natural question is how to compute a feasible sub-specification. To answer this question, this paper investigates the computation of supremal simulation-based controllable and strong observable subautomata by using lattice theory. First, three monotone operators-simulation operator, controllable operator and strong observable operator are constructed upon a complete lattice. Based on these operators, inequalities are then formulated, whose solution is a simulation-based controllable and strong observable set. In particular, a sufficient condition is presented to guarantee the existence of a supremal simulation-based controllable and strong observable subautomaton. When such an existence condition holds, an algorithm is further proposed to compute the supremal simulation-based controllable and strong observable automaton.

Bisimulation Lattice Theory Discrete Event Systems Nondeterministic Systems Partial Observation

Yajuan Sun Hai Lin Fuchun Liu

Department Electrical and Computer Engineering, National University Of Singapore, Singapore 117576 Department of Electrical Engineering, University of Notre Dame, USA 6556 Faculty of Computer, Guangdong University of Technology, China 510006

国际会议

The 31st Chinese Control Conference(第三十一届中国控制会议)

合肥

英文

2128-2133

2012-07-01(万方平台首次上网日期,不代表论文的发表时间)