Benchmarks for Hybrid Systems Verification

Fehnker, Ansgar; Ivančić, Franjo

doi:10.1007/978-3-540-24743-2_22

Cited by 149 publications

(131 citation statements)

References 9 publications

Supporting

Mentioning

131

Contrasting

Order By: Relevance

“…This section presents a case study of the multi-room heating benchmark introduced in [22], based on a model proposed by [35] and already discussed in Section 2. The objective is to evaluate the usefulness of probabilistic model checking for the (approximate) verification (and optimisation) of an LMP.…”

Section: Case Studymentioning

confidence: 99%

“…As there are now two rooms, following [22] we also include the heat transfer between the rooms in the equations. Letting s k ∈ R 2 denote the temperatures in the rooms at time instant t k , we have that the equation for room i ∈ 1, 2 (assuming j is the other room) is given by: (4) where x a represents the ambient temperature (assumed to be constant) and a the heat transfer rate between the rooms.…”

Section: Case Studymentioning

confidence: 99%

See 1 more Smart Citation

Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations

Abate

Kwiatkowska

Norman

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper concerns labelled Markov processes (LMPs), probabilistic models over uncountable state spaces originally introduced by Prakash Panangaden and colleagues. Motivated by the practical application of the LMP framework, we study its formal semantics and the relationship to similar models formulated in control theory. We consider notions of (exact and approximate) probabilistic bisimulation over LMPs and, drawing on methods from both formal verification and control theory, propose a simple technique to compute an approximate probabilistic bisimulation of a given LMP, where the resulting abstraction is characterised as a finite-state labelled Markov chain (LMC). This construction enables the application of automated quantitative verification and policy synthesis techniques over the obtained abstract model, which can be used to perform approximate analysis of the concrete LMP. We illustrate this process through a case study of a multi-room heating system that employs the probabilistic model checker PRISM.

show abstract

Section: Case Studymentioning

confidence: 99%

Section: Case Studymentioning

confidence: 99%

Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations

Abate

Kwiatkowska

Norman

et al. 2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We test our approach on the NAV benchmarks that are commonly used to evaluate hybrid system verification tools [21]. These benchmarks model a particle traveling on a 2 dimensional grid of cells.…”

Section: B Benchmarksmentioning

confidence: 99%

A trajectory splicing approach to concretizing counterexamples for hybrid systems

Zutshi

Sankaranarayanan

Deshmukh³

et al. 2013

52nd IEEE Conference on Decision and Control

View full text Add to dashboard Cite

Abstract-This paper examines techniques for finding falsifying trajectories of hybrid systems using an approach that we call trajectory splicing. Many formal verification techniques for hybrid systems, including flowpipe construction, can identify plausible abstract counterexamples for property violations. However, there is often a gap between the reported abstract counterexamples and the concrete system trajectories. Our approach starts with a candidate sequence of disconnected trajectory segments, each segment lying inside a discrete mode. However, such disconnected segments do not form concrete violations due to the gaps that exist between the ending state of one segment and the starting state of the subsequent segment. Therefore, trajectory splicing uses local optimization to minimize the gap between these segments, effectively splicing them together to form a concrete trajectory.We demonstrate the use of our approach for falsifying safety properties of hybrid systems using standard optimization techniques. As such, our approach is not restricted to linear systems. We compare our approach with other falsification approaches including uniform random sampling and a robustness guided falsification approach used in the tool S-Taliro. Our preliminary evaluation clearly shows the potential of our approach to search for candidate trajectory segments and use them to find concrete property violations.

show abstract

“…We have implemented our methodology and applied it to the navigation benchmark proposed in [5], for which we have implemented a prototype. The first results that we have obtained are encouraging.…”

Section: Introductionmentioning

confidence: 99%

Automatic Rectangular Refinement of Affine Hybrid Systems

Doyen

Henzinger

Raskin

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We show how to automatically construct and refine rectangular abstractions of systems of linear differential equations. From a hybrid automaton whose dynamics are given by a system of linear differential equations, our method computes automatically a sequence of rectangular hybrid automata that are increasingly precise overapproximations of the original hybrid automaton. We prove an optimality criterion for successive refinements. We also show that this method can take into account a safety property to be verified, refining only relevant parts of the state space. The practicability of the method is illustrated on a benchmark case study.

show abstract

Benchmarks for Hybrid Systems Verification

Cited by 149 publications

References 9 publications

Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations

Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations

A trajectory splicing approach to concretizing counterexamples for hybrid systems

Automatic Rectangular Refinement of Affine Hybrid Systems

Contact Info

Product

Resources

About