Rational series and their languages
Rational series and their languages
Theoretical Computer Science
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Efficient Guiding Towards Cost-Optimality in UPPAAL
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Preemptive Job-Shop Scheduling Using Stopwatch Automata
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On the optimal reachability problem of weighted timed automata
Formal Methods in System Design
Optimal reachability for multi-priced timed automata
Theoretical Computer Science
Optimal infinite scheduling for multi-priced timed automata
Formal Methods in System Design
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Weighted Timed Automata: Model-Checking and Games
Electronic Notes in Theoretical Computer Science (ENTCS)
On model-checking timed automata with stopwatch observers
Information and Computation
Improved undecidability results on weighted timed automata
Information Processing Letters
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
A Kleene-Schützenberger theorem for weighted timed automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
| Hi-index | 0.00 |
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and introduced a general model of weighted timed automata defined over a semiring and a family of cost functions. In this model, a weighted timed automaton recognizes a timed series , i.e., a function mapping to each timed word a weight taken from the semiring. Continuing in this spirit, the aim of this paper is to investigate the support and cut languages of recognizable timed series. We present results that lead to the decidability of weighted versions of classical decidability problems as e.g. the emptiness problem. Our results may also be used to check whether weighted timed systems satisfy specifications restricting the consumption of a resource.