Skip to Main content Skip to Navigation
Conference papers

Featured Weighted Automata

Uli Fahrenberg 1 Axel Legay 2 
2 TAMIS - Threat Analysis and Mitigation for Information Security
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : A featured transition system is a transition system in which the transitions are annotated with feature expressions: Boolean expressions on a nite number of given features. Depending on its feature expression, each individual transition can be enabled when some features are present, and disabled for other sets of features. e behavior of a featured transition system hence depends on a given set of features. ere are algorithms for featured transition systems which can check their properties for all sets of features at once, for example for LTL or CTL properties. Here we introduce a model of featured weighted automata which combines featured transition systems and (semiring-) weighted au-tomata. We show that methods and techniques from weighted automata extend to featured weighted automata and devise algorithms to compute quantitative properties of featured weighted automata for all sets of features at once. We show applications to minimum reachability and to energy properties.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Nisrine JAFRI Connect in order to contact the contributor
Submitted on : Wednesday, December 19, 2018 - 4:22:50 PM
Last modification on : Saturday, August 6, 2022 - 3:32:33 AM

Links full text



Uli Fahrenberg, Axel Legay. Featured Weighted Automata. 5th FME Workshop on Formal Methods in Software Engineering (FormaliSE 2017), May 2017, Buenos Aires, Argentina. ⟨10.1109/FormaliSE.2017.2⟩. ⟨hal-01640074⟩



Record views