In this paper, we present how to synthesize controllers enforce $\omega$-regular properties over linear control systems affected by bounded disturbances. particular, these are synthesized based on so-called hybrid controlled invariant (HCI) sets. To compute sets, first construct a product system between the and deterministic Streett automata (DSA) modeling desired property. Then, maximal HCI se...

In this paper we present a framework for carrying out counterexample guided abstraction-refinement (CEGAR) for systems modelled as rectangular hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we consider the abstractions to be hybrid automata as well. We show that the CEGAR scheme is semi-complete for the class of rectangul...

In this paper, we present the tool AVERIST, which implements an algorithmic approach for the stability analysis of polyhedral switched systems. It implements an abstraction based model-checking approach proposed in the earlier work of the authors. The tool constructs a weighted graph abstracting the polyhedral hybrid system, and analyzes the graph to infer stability. In the case that the hybrid...

In this paper we study the problem of automatically generating switching controllers for the class of Linear Hybrid Automata, with respect to safety objectives. While the same problem has been already considered in the literature, no sound and complete solution has been provided so far. We identify and solve inaccuracies contained in previous characterizations of the problem, providing a sound ...

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

The main goal of the present study was to implement a hybrid pattern of cellular automata model and particle swarm optimization algorithm based on TM and ETM+ imagery of landsat satellite from 1988 to 2010 for simulating the urban sprawling. In this study, an alternative model was implemented in two ways: the first method was based on two images (1988 and 2010) and the second one was based on t...

Hybrid systems are characterized by a mix of analog and digital inputs and outputs. We deene such systems formally as hybrid automata, and discuss how to specify interesting properties of them. A few approaches to verifying hybrid systems are outlined: reachability analysis, model-checking on nite-state approximating automata, theorem proving, and linear programming. These approaches work with ...

This paper provides results on invariant approximations of robustly positively invariant sets for a discrete-time, linear, time-invariant system subject to state constraints. Two important sets, the minimal and the maximal robustly positively invariant sets and their approximations are investigated. Novel procedures for the computation of invariant approximations to these sets are presented. It...

This paper presents a new algorithm for generating nite-state automata models of hybrid systems in which the continuous-state dynamics can be switched when the continuous-state trajectory generates threshold events. The automata state transitions correspond to threshold events and the automata states correspond to portions of the threshold surfaces in the continuous state space. The hybrid syst...