Target control for hybrid systems with linear continuous dynamics

We consider the target control problem for hybrid systems with linear continuous dynamics. The system is modelled as a hybrid automaton. Control action is applied on the discrete level, while the continuous dynamics is subject to constant or set valued disturbance. The proposed controller ensures that the system can be transferred from any point of an initial set to a target set of the hybrid state space. A control design algorithm based on reachability analysis is proposed. For the implementation of the algorithm, approximate reachability analysis is employed. This involves under-approximation of reachable sets under linear continuous dynamics. The algorithm is applied to a batch control proble

Program Verification by Using DISCOVERER

Recent advances in program verification indicate that various verification problems can be reduced to semi-algebraic system (SAS for short) solving. An SAS consists of polynomial equations and polynomial inequalities. Algorithms for quantifier elimination of real closed fields are the general method for those problems. But the general method usually has low efficiency for specific problems. To overcome the bottleneck of program verification with a symbolic approach, one has to combine special techniques with the general method. Based on the work of complete discrimination systems of polynomials [33,31], we invented new theories and algorithms [32,30,35] for SAS solving and partly implemented them as a real symbolic computation tool in Maple named DISCOVERER. In this paper, we first summarize the results that we have done so far both on SAS-solving and program verification with DISCOVERER, and then discuss the future work in this direction, including SAS-solving itself, termination analysis and invariant generation of programs, and reachability computation of hybrid systems etc. ? IFIP International Federation for Information Processing 2008.EI

Optimal Reachability in Divergent Weighted Timed Games

Weighted timed games are played by two players on a timed automaton equipped with weights: one player wants to minimise the accumulated weight while reaching a target, while the other has an opposite objective. Used in a reactive synthesis perspective, this quantitative extension of timed games allows one to measure the quality of controllers. Weighted timed games are notoriously difficult and quickly undecidable, even when restricted to non-negative weights. Decidability results exist for subclasses of one-clock games, and for a subclass with non-negative weights defined by a semantical restriction on the weights of cycles. In this work, we introduce the class of divergent weighted timed games as a generalisation of this semantical restriction to arbitrary weights. We show how to compute their optimal value, yielding the first decidable class of weighted timed games with negative weights and an arbitrary number of clocks. In addition, we prove that divergence can be decided in polynomial space. Last, we prove that for untimed games, this restriction yields a class of games for which the value can be computed in polynomial time

Computer Aided Verification

The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency

Control of Hidden Mode Hybrid Systems: Algorithm termination

We consider the problem of safety control in Hidden Mode Hybrid Systems (HMHS) that arises in the development of a semi-autonomous cooperative active safety system for collision avoidance at an intersection. We utilize the approach of constructing a new hybrid automaton whose discrete state is an estimate of the HMHS mode. A dynamic feedback map can then be designed that guarantees safety on the basis of the current mode estimate and the concept of the capture set. In this work, we relax the conditions for the termination of the algorithm that computes the capture set by constructing an abstraction of the new hybrid automaton. We present a relation to compute the capture set for the abstraction and show that this capture set is equal to the one for the new hybrid automaton

Computer Aided Verification

The open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency

Safety control of piece-wise continuous order preserving systems

This paper is concerned with safety control of systems with imperfect state information and disturbance input. Specifically, we consider the class of systems whose dynamics preserve a partial ordering. We provide necessary and sufficient conditions under which a given set of initial states is steerable away from a specified bad set. Moreover, a control strategy is provided that guarantees that the bad set is avoided. Such characterization is achieved for order preserving systems while for general systems only an approximated solution is achievable. A method for implementation of the control strategy is provided and the effectiveness of the proposed method is illustrated via a numerical example and employed for obstacle avoidance of a ship.National Science Foundation (U.S.) (NSF CAREER AWARD # CNS-0642719

Safety control of hidden mode hybrid systems

In this paper, we consider the safety control problem for hidden mode hybrid systems (HMHSs), which are a special class of hybrid automata in which the mode is not available for control. For these systems, safety control is a problem with imperfect state information. We tackle this problem by introducing the notion of nondeterministic discrete information state and by translating the problem to one with perfect state information. The perfect state information control problem is obtained by constructing a new hybrid automaton, whose discrete state is an estimate of the HMHS mode and is, as such, available for control. This problem is solved by computing the capture set and the least restrictive control map for the new hybrid automaton. Sufficient conditions for the termination of the algorithm that computes the capture set are provided. Finally, we show that the solved perfect state information control problem is equivalent to the original problem with imperfect state information under suitable assumptions. We illustrate the application of the proposed technique to a collision avoidance problem between an autonomous vehicle and a human driven vehicle at a traffic intersection.National Science Foundation (U.S.) (NSF CAREER Award Number CNS-0642719

Porous Invariants

AbstractWe introduce the notion of porous invariants for multipath (or branching/nondeterministic) affine loops over the integers; these invariants are not necessarily convex, and can in fact contain infinitely many ‘holes’. Nevertheless, we show that in many cases such invariants can be automatically synthesised, and moreover can be used to settle (non-)reachability questions for various interesting classes of affine loops and target sets. </jats:p

Constructive Hybrid Games

Hybrid games are models which combine discrete, continuous, and adversarial dynamics. Game logic enables proving (classical) existence of winning strategies. We introduce constructive differential game logic (CdGL) for hybrid games, where proofs that a player can win the game correspond to computable winning strategies. This is the logical foundation for synthesis of correct control and monitoring code for safety-critical cyber-physical systems. Our contributions include novel static and dynamic semantics as well as soundness and consistency.Comment: 60 pages, preprint, under revie