Analysis of hybrid systems using HySAT

In this paper we describe the complete workflow of analyzing the dynamic behavior of safety-critical embedded systems with HySAT. HySAT is an arithmetic constraint solver with a tightly integrated bounded model checker for hybrid discrete-continuous systems which — in contrast to many other solvers — is not confined to linear arithmetic, but can also deal with nonlinear constraints involving transcendental functions. Based on a controller for train separation implementing a “moving block ” interlocking scheme in the forthcoming European Train Control System Level 3, we exemplify the usage of the tool over the whole cycle from encoding a hybrid system to interpreting the results

Multi-objective design of robust flight control systems

The aim of this work is to demonstrate the capabilities of evolutionary methods in the design of robust controllers for unstable fighter aircraft in the framework of H1 control theory. A multi–objective evolutionary algorithm is used to find the controller gains that minimize a weighted combination of the infinite–norm of the sensitivity function (for disturbance attenuation requirements) and complementary sensitivity function (for robust stability requirements). After considering a single operating point for a level flight trim condition of a F-16 fighter aircraft model, two different approaches will then be considered to extend the domain of validity of the control law: 1) the controller is designed for different operating points and gain scheduling is adopted; 2) a single control law is designed for all the considered operating points by multiobjective minimisation. The two approaches will be analysed and compared in terms of efficacy and required human and computational resources

Generating Property-Directed Potential Invariants By Backward Analysis

This paper addresses the issue of lemma generation in a k-induction-based formal analysis of transition systems, in the linear real/integer arithmetic fragment. A backward analysis, powered by quantifier elimination, is used to output preimages of the negation of the proof objective, viewed as unauthorized states, or gray states. Two heuristics are proposed to take advantage of this source of information. First, a thorough exploration of the possible partitionings of the gray state space discovers new relations between state variables, representing potential invariants. Second, an inexact exploration regroups and over-approximates disjoint areas of the gray state space, also to discover new relations between state variables. k-induction is used to isolate the invariants and check if they strengthen the proof objective. These heuristics can be used on the first preimage of the backward exploration, and each time a new one is output, refining the information on the gray states. In our context of critical avionics embedded systems, we show that our approach is able to outperform other academic or commercial tools on examples of interest in our application field. The method is introduced and motivated through two main examples, one of which was provided by Rockwell Collins, in a collaborative formal verification framework.Comment: In Proceedings FTSCS 2012, arXiv:1212.657

Constraint-based reachability

Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it requires to deal with an infinite number of states with standard backward or forward exploration strategies. An approach that we call Constraint-based reachability, is proposed to address reachability problems by exploring program states using a constraint model of the whole program. The keypoint of the approach is to interpret imperative constructions such as conditionals, loops, array and memory manipulations with the fundamental notion of constraint over a computational domain. By combining constraint filtering and abstraction techniques, Constraint-based reachability is able to solve reachability problems which are usually outside the scope of backward or forward exploration strategies. This paper proposes an interpretation of classical filtering consistencies used in Constraint Programming as abstract domain computations, and shows how this approach can be used to produce a constraint solver that efficiently generates solutions for reachability problems that are unsolvable by other approaches.Comment: In Proceedings Infinity 2012, arXiv:1302.310

Successful Demand Forecasting Modeling Strategies for Increasing Small Retail Medical Supply Profitability

The lack of effective demand forecasting strategies can result in imprecise inventory replenishment, inventory overstock, and unused inventory. The purpose of this single case study was to explore successful demand forecasting strategies that leaders of a small, retail, medical supply business used to increase profitability. The conceptual framework for this study was Winters\u27s forecasting demand approach. Data were collected from semistructured, face-to-face interviews with 8 business leaders of a private, small, retail, medical supply business in the southeastern United States and the review of company artifacts. Yin\u27s 5-step qualitative data analysis process of compiling, disassembling, reassembling, interpreting, and concluding was applied. Key themes that emerged from data analysis included understanding sales trends, inventory management with pricing, and seasonality. The findings of this study might contribute to positive social change by encouraging leaders of medical supply businesses to apply demand forecasting strategies that may lead to benefits for medically underserved citizens in need of accessible and abundant medical supplies