Benchmarks for hybrid systems verification

150Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.
Get full text

Abstract

There are numerous application examples for hybrid systems verification in recent literature. Most of them were introduced to illustrate a new approach to hybrid systems verification, and are therefore of a limited size. Others are case studies that serve to prove that an approach can be applied to real world problems. Verification of these typically requires a lot of domain experience to obtain a tractable, verifiable model. Verification of a case study yields a singular result that is hard to compare and time-consuming to reproduce. This paper introduces three benchmarks for hybrid systems verification. These benchmarks are independent from a particular approach to verification, they have a limited domain, and have a simple basic structure. Nevertheless, these benchmarks can be scaled to arbitrary complexity, and offer the possibility to inject phenomena that are known to be problematic in hybrid verification. This paper presents result for a first set of instances, as an example of how these benchmark can be used to compare different tools and approaches. © Springer-Verlag '. 2004.

Cite

CITATION STYLE

APA

Fehnker, A., & Ivančić, F. (2004). Benchmarks for hybrid systems verification. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2993, 326–341. https://doi.org/10.1007/978-3-540-24743-2_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free