Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. While computability issues concerning safety properties have been extensively studied, liveness properties have remained largely uninvestigated. In this article, we investigate de-cidability of state recurrence and of progress properties...

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

We present some new decidability results on the veri cation of hybrid automata by symbolic analysis (abstract interpretation using polyhedra). The results include de ning a class of hybrid automata for which all properties expressed in the real-time temporal logic Tctl are decidable. The obtained class of automata is shown powerful enough to model reactive applications in which every task event...

Many of today’s embedded systems – such as automobiles, automated factories or chemical plants – are an increasingly complex mixture of hardware components and embedded control software, showing both continuous (vehicle dynamics, silo fill levels) and discrete (software) behavior. As complexity grows, handling such systems, e.g. diagnosing and repairing faults, becomes harder. This problem is a...

This paper gives a short overview of a model checking tool for Cottbus Timed Automata, which is a modular modeling language based on timed and hybrid automata. For timed automata, the current version of the tool provides BDD-based verification using an integer semantics. Reachability analysis as well as refinement checking is possible. To find good variable orderings it uses the component struc...

In this paper we introduce and study a new class of hybrid automata, Independent Dynamics Hybrid Automata (IDA). IDA are an extension of decidable O-minimal automata in which also identity resets are allowed. We define the conditions under which reachability is decidable over IDA. These conditions involve the satisfiability of first-order formulæ that limit the interval of time we need to consi...

image segmentation is an important task in image processing and computer vision which attract many researchers attention. there are a couple of information sets pixels in an image: statistical and structural information which refer to the feature value of pixel data and local correlation of pixel data, respectively. markov random field (mrf) is a tool for modeling statistical and structural inf...

The hybrid Chi (χ) language is a formalism for modeling, simulation and verification of hybrid systems. One of the most widely known hybrid system formalisms is that of hybrid automata. The formal translation of χ to hybrid automata enables verification of χ specifications using existing hybrid automata based verification tools. In this paper, we describe the translation from χ to hybrid automa...