Formal Analysis of Hybrid Systems Using Feature Indented Assertions

Model based design is a recommended step in the design of embedded control systems. A formal analysis of models helps in arriving at provably correct designs that meet the necessary functional requirements. Often such analysis needs to look beyond functional correctness to evaluate the margins of behavioral attributes. Our notion of features addresses this requirement. The syntactic fabric of our feature definitions enjoys similarity with assertion languages; however, unlike assertions, the consequent of features are real valued expressions representing the feature value. In this article, we give insights into the extensive work we have done in the formal analysis of features for hybrid models. We describe a methodology for abstract interpretation of features over hybrid automata models, leveraging reachability solvers for extracting feature ranges formally and further demonstrate how Satisfiability Modulo Theory (SMT) solvers can be used for extracting behavioural traces corresponding to corner cases of a feature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2020

Quantitative Corner Case Feature Analysis of Hybrid Automata with ForFET^SMT

The analysis and verification of hybrid automata (HA) models against ric...
research
07/14/2022

Model Checking for Rectangular Hybrid Systems: A Quantified Encoding Approach

Satisfiability Modulo Theories (SMT) solvers have been successfully appl...
research
07/20/2017

Representing Hybrid Automata by Action Language Modulo Theories

Both hybrid automata and action languages are formalisms for describing ...
research
04/13/2020

Detecting Critical Bugs in SMT Solvers Using Blackbox Mutational Fuzzing

Formal methods use SMT solvers extensively for deciding formula satisfia...
research
06/18/2021

Modeling of Personalized Privacy Disclosure Behavior: A Formal Method Approach

In order to create user-centric and personalized privacy management tool...
research
02/17/2020

Denotational semantics as a foundation for cost recurrence extraction for functional languages

A standard method for analyzing the asymptotic complexity of a program i...
research
08/23/2021

Towards a Formal Modelling, Analysis, and Verification of a Clone Node Attack Detection Scheme in the Internet of Things

In a clone node attack, an attacker attempted to physically capture the ...

Please sign up or login with your details

Forgot password? Click here to reset