Estimating Reachable States of Hybrid Systems via -complete Approximations
نویسندگان
چکیده
This contribution treats the estimation of reachable states for time invariant hybrid systems. Using the framework provided by Willems’ behavioural systems theory, we suggest a method based on -complete approximations, which can be realized by finite state machines. The approximating behaviour is a superset of the original behaviour. Hence, the estimate of reachable states based on an -complete approximation can be shown to be conservative, i. e. the exact set of reachable states is guaranteed to be contained in the estimate. Because of this property our method is adequate for verification tasks where the state variable has to remain within a certain specification.
منابع مشابه
ESTIMATING REACHABLE STATES OF HYBRID SYSTEMS VIA l-COMPLETE APPROXIMATIONS
This contribution treats the estimation of reachable states for time invariant hybrid systems. Using the framework provided by Willems’ behavioural systems theory, we suggest a method based on l-complete approximations, which can be realized by finite state machines. The approximating behaviour is a superset of the original behaviour. Hence, the estimate of reachable states based on an l-comple...
متن کاملEfficient Computation of Reachable Sets of Linear Time-Invariant Systems with Inputs
This work is concerned with the problem of computing the set of reachable states for linear time-invariant systems with bounded inputs. Our main contribution is a novel algorithm which improves significantly the computational complexity of reachability analysis. Algorithms to compute over and under-approximations of the reachable sets are proposed as well. These algorithms are not subject to th...
متن کاملDesigning a hybrid quantum controller for strongly eigenstate controllable systems
In this paper, a new quantum hybrid controller for controlling the strongly eigenstate controllable systems, is designed. For this purpose, a Lyapunov control law is implemented when the target state is in reachable set of the initial state. On the other hand, if the target state is not in the reachable set of the given initial state, based on Grover algorithm, a new interface state that the t...
متن کاملDistributed state estimation for hybrid and discrete event systems using l-complete approximations
Abstract: The topic of this paper is distributed state estimation for time-invariant systems with finite input and output spaces. We assume that the system under investigation can be realised by a hybrid I/S/O-machine, where some of the discrete states may also represent failure modes. Our approach is based on previous work, e.g., Moor and Raisch (1999); Moor et al. (2002), where l-complete app...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کامل