Open AccessDissertation
Detection of Feature Interactions in Automotive Active Safety Features
Juarez Dominguez,L Alma +1 more
- 02 May 2012
TL;DR: The key novel characteristic of this work is exploiting domain-specific information about the feature interaction problem and the structure of the model to produce a method that finds a representation of all different feature interactions for automotive active safety features at design time.
read more
Abstract: With the introduction of software into cars, many functions are now realized with reduced cost, weight and energy. The development of these software systems is done in a distributed manner independently by suppliers, following the traditional approach of the automotive industry, while the car maker takes care of the integration. However, the integration can lead to unexpected and unintended interactions among software systems, a phenomena regarded as feature interaction. This dissertation addresses the problem of the automatic detection of feature interactions for automotive active safety features. Active safety features control the vehicle’s motion control systems independently from the driver’s request, with the intention of increasing passengers’ safety (e.g., by applying hard braking in the case of an identified imminent collision), but their unintended interactions could instead endanger the passengers (e.g., simultaneous throttle increase and sharp narrow steering, causing the vehicle to roll over). My method decomposes the problem into three parts: (I) creation of a definition of feature interactions based on the set of actuators and domain expert knowledge; (II) translation of automotive active safety features designed using a subset of Matlab’s Stateflow into the input language of the model checker SMV; (III) analysis using model checking at design time to detect a representation of all feature interactions based on partitioning the counterexamples into equivalence classes. The key novel characteristic of my work is exploiting domain-specific information about the feature interaction problem and the structure of the model to produce a method that finds a representation of all different feature interactions for automotive active safety features at design time. My method is validated by a case study with the set of non-proprietary automotive feature design models I created. The method generates a set of counterexamples that represent the whole set of feature interactions in the case study. By showing only a set of representative feature interaction cases, the information is concise and useful for feature designers. Moreover, by generating these results from feature models designed in Matlab’s Stateflow translated into SMV models, the feature designers can trace the counterexamples generated by SMV and understand the results in terms of the Stateflow model. I believe that my results and techniques will have relevance to the solution of the feature interaction problem in other cyber-physical systems, and have a direct impact in assessing the safety of automotive systems.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
An operational semantics for stateflow
Gregoire Hamon,John Rushby +1 more
TL;DR: In this paper, the authors present a formal operational semantics for Stateflow, the graphical Statecharts-like language of the Matlab/Simulink tool suite that is widely used in model-based development of embedded systems.
128
•Journal Article
Towards a classification of web service feature interactions
TL;DR: In this article, a classification of feature interactions among web services is presented, which is beneficial as it can then search for ways of detecting and resolving each class of feature interaction in a generic manner.
59
Run-time monitoring of self-adaptive systems to detect N-way feature interactions and their causes
Byron DeVries,Betty H. C. Cheng +1 more
- 28 May 2018
TL;DR: Thoosa is introduced, an approach for using models at run time to detect features that can fail due to n-way feature interactions atrun time and thereby trigger mitigating adaptations and/or updates to the requirements.
15
Software variability in service robotics
Sergio Garcia,Daniel Strüber,Davide Brugali,Alessandro Di Fava,Patrizio Pelliccione,Thorsten Berger +5 more
TL;DR: In this article , the authors present a multiple-case study on software variability in the vibrant and challenging domain of service robotics, and investigate drivers, practices, methods, and challenges of variability from industrial companies building service robots.
15
•Dissertation
A Feature-Oriented Modelling Language and a Feature-Interaction Taxonomy for Product-Line Requirements
Pourya Shaker
- 18 Dec 2013
TL;DR: The thesis identifies the problem of developing a suitable language for expressing feature-oriented models of the functional requirements of an SPL, and presents the feature- oriented requirements modelling language (FORML) as a solution to this problem.
12
References
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
Statecharts: A visual formalism for complex systems
TL;DR: It is intended to demonstrate here that statecharts counter many of the objections raised against conventional state diagrams, and thus appear to render specification by diagrams an attractive and plausible approach.
7.5K
•Book
The Temporal Logic of Reactive and Concurrent Systems: Specification
Amir Pnueli,Zohar Manna +1 more
- 18 Dec 1991
TL;DR: An introduction to temporal logic and a computational model for reactive systems .
3.6K
•Book
Symbolic Model Checking
Edmund M. Clarke,Kenneth L. McMillan,Sérgio Campos,Vassili Hartonas-Garmhausen +3 more
- 31 Jul 1993
TL;DR: Using symbolic model checking techniques it is possible to verify industrial-size finite state systems and models with more than 10120 states have been verified using special techniques.
Symbolic model checking: 10/sup 20/ states and beyond
Jerry R. Burch,Edmund M. Clarke,Kenneth L. McMillan,David L. Dill,L.J. Hwang +4 more
- 04 Jun 1990
TL;DR: In this paper, a model-checking algorithm for mu-calculus formulas which uses R.E. Bryant's (1986) binary decision diagrams to represent relations and formulas symbolically is described.