Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...

This paper concerns computational methods for verifying properties of polyhedral invariant hybrid automata (PIHA), which are hybrid automata with discrete transitions governed by polyhedral guards. To verify properties of the state trajectories for PIHA, the planar switching surfaces are partitioned to define a finite set of discrete states in an approximate quotient transition system (AQTS). S...

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...

Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...

A hybrid automaton is a mathematical model for hybrid systems, which combines, in a single formalism, automaton transitions for capturing discrete updates with differential constraints for capturing continuous ows. Formal veriication of hybrid au-tomata relies on symbolic xpoint computation procedures that manipulate sets of states. These procedures can be implemented using boolean combinations...

In this paper, we present Aspic, an automatic polyhedral invariant generation tool for flowcharts programs. Aspic implements an improved Linear Relation Analysis on numeric counter automata. The “accelerated” method improves precision by computing locally a precise overapproximation of a loop without using the widening operator. c2fsm is a C preprocessor that generates automata in the format re...

Hybrid automata have been proposed as a language for modelling and analysing the interaction of digital and analogue dynamics in embedded computation systems. In this paper, hybrid automata are studied from a dynamical systems perspective. Extending earlier work on conditions for local existence and uniqueness of executions of hybrid automata, we characterise a class of hybrid automata whose ex...

Hybrid automata have been proposed as a language for modelling and analysing the interaction of digital and analogue dynamics in embedded computer systems. In this paper, hybrid automata are studied from a dynamical systems perspective. Extending earlier work on conditions for local existence and uniqueness of executions of hybrid automata, we characterise a class of hybrid automata whose execu...

This paper presents an extension of existing software architecture tools to model physical systems, their interconnections, and the interactions between physical and cyber components. A new CPS architectural style is introduced to support the principled design and evaluation of alternative architectures for cyberphysical systems (CPSs). The implementation of the CPS architectural style in AcmeS...

Invariant set theory has been widely studied in the literature, see for example [1, 2] and reference therein. [1] gives a compressive review of the invariant set theory. [2] brings together some of the main ideas in set invariance theory and places them in a general, nonlinear setting. A similar concept, maximal safety set, has been studied in the literature of hybrid systems. The authors of [7...