Lower-bound-constrained runs in weighted timed automata

Bouyer, Patricia; Larsen, Kim Guldstrand; Markey, Nicolas

doi:10.1016/j.peva.2013.11.002

Cited by 19 publications

(20 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ey are concerned with the question whether a given system admits infinite schedules during which (1) certain tasks can be repeatedly accomplished and (2) the system never runs out of energy (or other specified resources). Starting with [3], formal modeling and analysis of such problems has a racted some a ention [2,4,5,9,14,18,22].…”

Section: Introductionmentioning

confidence: 99%

Featured Weighted Automata

Fahrenberg¹,

Legay²

2017

2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)

View full text Add to dashboard Cite

A featured transition system is a transition system in which the transitions are annotated with feature expressions: Boolean expressions on a finite 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 automata. 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.

show abstract

Section: Introductionmentioning

confidence: 99%

Featured Weighted Automata

Fahrenberg¹,

Legay²

2017

2017 IEEE/ACM 5th International FME Workshop on Formal Methods in Software Engineering (FormaliSE)

View full text Add to dashboard Cite

show abstract

“…There are interesting generalizations of our setting of energy automata which, we believe, can be attacked using techniques similar to ours. One such generalization are energy problems for real time or hybrid models, as for example treated in [3][4][5]23]. Another generalization is to higher dimensions, like in [16,19,24] and other papers.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

*-Continuous Kleene ω-Algebras for Energy Problems

Ésik

Fahrenberg

Legay

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Energy problems are important in the formal analysis of embedded or autonomous systems. Using recent results on * -continuous Kleene ω-algebras, we show here that energy problems can be solved by algebraic manipulations on the transition matrix of energy automata. To this end, we prove general results about certain classes of finitely additive functions on complete lattices which should be of a more general interest. IntroductionEnergy problems are concerned with the question whether a given system admits infinite schedules during which (1) certain tasks can be repeatedly accomplished and (2) the system never runs out of energy (or other specified resources). These are important in areas such as embedded systems or autonomous systems and, starting with [4], have attracted some attention in recent years, for example in [3, 5-8, 16, 19, 23, 24].With the purpose of generalizing some of the above approaches, we have in [12,17] introduced energy automata. These are finite automata whose transitions are labeled with energy functions which specify how energy values change from one system state to another. Using the theory of semiring-weighted automata [9], we have shown in [12] that energy problems in such automata can be solved in a simple static way which only involves manipulations of energy functions.In order to put the work of [12] on a more solid theoretical footing and with an eye to future generalizations, we have recently introduced a new algebraic structure of * -continuous Kleene ω-algebras [10] (see also [11] for the long version). We show here that energy functions form such a * -continuous Kleene ω-algebra. Using the fact, proven in [10], that for automata with transition weights in * -continuous Kleene ω-algebras, reachability and Büchi acceptance can be computed by algebraic manipulations on the transition matrix of the automaton, the results from [12] follow. Energy AutomataThe transition labels on the energy automata which we consider in the paper, will be functions which model transformations of energy levels between system states. Such transformations have the (natural) properties that below a certain energy level, the transition might be disabled (not enough energy is available to perform the transition), and an increase in input energy always yields at least the same increase in output energy.

show abstract

“…Energy Problems on Timed Automata with Discrete Weights. Next we will consider an interesting extension of lower-bound energy problems on weighted timed automata, introduced in [11], which gained attention in the last years, see, e.g., [12,37,10]. In lower-bound energy problems, one is interested whether in a given automaton with some weight variable whose value can be increased and decreased, there exists a successful run in which all accumulated weight values are never below zero.…”

Section: K Quaasmentioning

confidence: 99%

Verification for Timed Automata extended with Unbounded Discrete Data Structures

Quaas

2015

Logical Methods in Computer Science

View full text Add to dashboard Cite

Abstract. We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. In this way, we obtain a strong model that may for instance be used to model real-time programs with procedure calls. It is long known that the reachability problem for this model is decidable. The goal of this paper is to identify subclasses of timed pushdown automata for which the language inclusion problem and related problems are decidable.

show abstract

Lower-bound-constrained runs in weighted timed automata

Cited by 19 publications

References 17 publications

Featured Weighted Automata

Featured Weighted Automata

*-Continuous Kleene ω-Algebras for Energy Problems

Verification for Timed Automata extended with Unbounded Discrete Data Structures

Contact Info

Product

Resources

About