Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 30 Dec 2020 in cs.FL and cs.LO | (2101.01255v1)

Abstract: The analysis and verification of hybrid automata (HA) models against rich formal properties can be a challenging task. Existing methods and tools can mainly reason whether a given property is satisfied or violated. However, such qualitative answers might not provide sufficient information about the model behaviors. This paper presents the ForFET${SMT}$ tool which can be used to reason quantitatively about such properties. It employs feature automata and can evaluate quantitative property corners of HA. ForFET${SMT}$ uses two third-party formal verification tools as its backbone: the SpaceEx reachability tool and the SMT solver dReach/dReal. Herein, we describe the design and implementation of ForFET${SMT}$ and present its functionalities and modules. To improve the usability of the tool for non-expert users, we also provide a list of quantitative property templates.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.