A Kleene-Schützenberger theorem for weighted timed automata
From MaRDI portal
Publication:631775
DOI10.1016/j.tcs.2010.12.033zbMath1217.68128OpenAlexW2011033500MaRDI QIDQ631775
Publication date: 14 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.033
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic analysis of hybrid systems
- Handbook of weighted automata
- Improved undecidability results on weighted timed automata
- A theory of timed automata
- Hybrid systems: computation and control. 4th international workshop, HSCC 2001, Rome, Italy, March 28--30, 2001. Proceedings
- HyTech: A model checker for hybrid systems
- Uppaal in a nutshell
- On the optimal reachability problem of weighted timed automata
- Optimal infinite scheduling for multi-priced timed automata
- Timed regular expressions
- On the definition of a family of automata
- Weighted Timed MSO Logics
- On the Supports of Recognizable Timed Series
- Fixed Point Theory
- Tools and Algorithms for the Construction and Analysis of Systems
- A Kleene-Schützenberger Theorem for Weighted Timed Automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Automata, Languages and Programming
- Formal Methods for the Design of Real-Time Systems
- Foundations of Software Science and Computational Structures
- Model-Checking One-Clock Priced Timed Automata
This page was built for publication: A Kleene-Schützenberger theorem for weighted timed automata
