Formal Feature Interpretation of Hybrid Systems

In current practice a formal analysis of hybrid system models is assertion-based. The work presented here is based on features that look beyond functional correctness toward a quantitative evaluation of behavioral attributes. A feature defines a real-valued evaluation function over a specific set of...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Antonio Anastasio Bruto da Costa, Frehse, Goran, Dasgupta, Pallab
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 22.02.2019
Subjects
Computer Science - Logic in Computer Science
Computer Science - Software Engineering
Domains
Feature extraction
Hybrid systems
Quantitative analysis
Solvers
Online AccessGet full text

Cover

More Information
Summary:In current practice a formal analysis of hybrid system models is assertion-based. The work presented here is based on features that look beyond functional correctness toward a quantitative evaluation of behavioral attributes. A feature defines a real-valued evaluation function over a specific set of traces. This paper describes an improved method for the interpretation of features over hybrid automata models. It further demonstrates how satisfiability modulo theory solvers can be used for extracting behavioral traces corresponding to corner cases of a feature. Results are demonstrated on examples from the control and circuit domains.
ISSN:2331-8422
DOI:10.48550/arxiv.1711.00669