A Kleene-Schützenberger Theorem for Weighted Timed Automata

DOI10.1007/978-3-540-78499-9_11zbMath1139.68031OpenAlexW1553601846MaRDI QIDQ5458356

Karin Quaas, Manfred Droste

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A Kleene-Schützenberger theorem for weighted timed automata, Iteration Semirings, MSO logics for weighted timed automata, Weighted Timed MSO Logics, On the Supports of Recognizable Timed Series

Uses Software

• HyTech

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Weighted automata and weighted logics
• 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
• Tools and Algorithms for the Construction and Analysis of Systems
• 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