This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonable LHA for which parametric verification of convex safety properties with exhaustive entry states can be verified in polynomial time and time-bounded reachability can be decided in nondeterministic polynomial time for non-parametric verification and in exponential time for parametric verification. Properties with exhaustive entry states are restricted to runs originating in a (specified) inner envelope of some mode-invariant. Deciding whether an LHA is reasonable is shown to be decidable in polynomial time
Industrial systems of practical relevance can be often characterized in terms of discrete control va...
Abstract. Lazy linear hybrid automata (LLHA) model the discrete time behavior of control systems con...
Abstract—A notion of diagnosability for hybrid systems is defined, which generalizes the common noti...
This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonab...
This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonab...
We study linear hybrid automata with dynamics of the form $\sum a_i x_i \leq a$ and $\sum b_i {\dot ...
Abstract. Linear hybrid automata (LHAs) are of particular interest to formal verification because se...
This paper provides a suite of optimization techniques for the verification of safety properties of ...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
This paper investigates safety analysis of reachability of timed automata hybrid systems as an exten...
In this paper we investigate safety analysis or reachability of timed automata hybrid systems as an ...
Safety verification of hybrid systems is undecidable, except for very special cases. In this paper, ...
We present LhaVrf, a symbolic verifier for the safety verification of concurrent LHA (Linear Hybrid ...
One of the main obstacles in the safety analysis of continuous and hybrid systems has been the compu...
We present an extension of the model checker Uppaal capable of synthesizing linear parameter constra...
Industrial systems of practical relevance can be often characterized in terms of discrete control va...
Abstract. Lazy linear hybrid automata (LLHA) model the discrete time behavior of control systems con...
Abstract—A notion of diagnosability for hybrid systems is defined, which generalizes the common noti...
This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonab...
This paper identifies an industrially relevant class of linear hybrid automata (LHA) called reasonab...
We study linear hybrid automata with dynamics of the form $\sum a_i x_i \leq a$ and $\sum b_i {\dot ...
Abstract. Linear hybrid automata (LHAs) are of particular interest to formal verification because se...
This paper provides a suite of optimization techniques for the verification of safety properties of ...
We introduce the framework of hybrid automata as a model and speci cation language for hybrid system...
This paper investigates safety analysis of reachability of timed automata hybrid systems as an exten...
In this paper we investigate safety analysis or reachability of timed automata hybrid systems as an ...
Safety verification of hybrid systems is undecidable, except for very special cases. In this paper, ...
We present LhaVrf, a symbolic verifier for the safety verification of concurrent LHA (Linear Hybrid ...
One of the main obstacles in the safety analysis of continuous and hybrid systems has been the compu...
We present an extension of the model checker Uppaal capable of synthesizing linear parameter constra...
Industrial systems of practical relevance can be often characterized in terms of discrete control va...
Abstract. Lazy linear hybrid automata (LLHA) model the discrete time behavior of control systems con...
Abstract—A notion of diagnosability for hybrid systems is defined, which generalizes the common noti...
Add to ORKG