Computer Science – Systems and Control
Scientific paper
2011-01-18
Computer Science
Systems and Control
22 pages, 1 figure
Scientific paper
Bisimulation relation has been successfully applied to computer science and control theory. In our previous work, simulation-based controllability and simulation-based observability are proposed, under which the existence of bisimilarity supervisor is guaranteed. However, a given specification automaton may not satisfy these conditions, and a natural question is how to compute a maximum permissive subspecification. This paper aims to answer this question and investigate the computation of the supremal simulation-based controllable and strong observable subautomata with respect to given specifications by the lattice theory. In order to achieve the supremal solution, three monotone operators, namely simulation operator, controllable operator and strong observable operator, are proposed upon the established complete lattice. Then, inequalities based on these operators are formulated, whose solution is the simulation-based controllable and strong observable set. In particular, a su?cient condition is presented to guarantee the existence of the supremal simulation-based controllable and strong observable subautomata. Furthermore, an algorithm is proposed to compute such subautomata.
Lin Hainan
Liu Fuchun
Sun Yajuan
No associations
LandOfFree
Computation for Supremal Simulation-Based Controllable and Strong Observable Subautomata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computation for Supremal Simulation-Based Controllable and Strong Observable Subautomata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation for Supremal Simulation-Based Controllable and Strong Observable Subautomata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-287211