A Kleene-Schützenberger theorem for weighted timed automata
type: Item
instance of: scholarly article
title: A Kleene-Schützenberger theorem for weighted timed automata
zbMATH Open document ID: 1217.68128
author: Manfred Droste
author: Karin Quaas
published in: Theoretical Computer Science
publication date: 2011-03-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5865597
zbMATH Keywords: weighted timed automata
zbMATH Keywords: timed languages
zbMATH Keywords: formal power series
zbMATH Keywords: Kleene theorem
describes a project that uses: Kronos
describes a project that uses: HyTech
describes a project that uses: Uppaal
describes a project that uses: UPPAAL CORA
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.12.033
OpenAlex ID: W2011033500
cites work: Automata, Languages and Programming
cites work: The algorithmic analysis of hybrid systems
cites work: A theory of timed automata
cites work: Q4552456
cites work: Formal Methods for the Design of Real-Time Systems
cites work: Timed regular expressions
cites work: Balanced timed regular expressions
cites work: Q4552463
cites work: Hybrid systems: computation and control. 4th international workshop, HSCC 2001, Rome, Italy, March 28--30, 2001. Proceedings
cites work: Q3994777
cites work: Q5506336
cites work: On the optimal reachability problem of weighted timed automata
cites work: Improved undecidability results on weighted timed automata
cites work: Optimal infinite scheduling for multi-priced timed automata
cites work: Synthesis of optimal strategies using \textsc{HyTech}
cites work: Model-Checking One-Clock Priced Timed Automata
cites work: Q4938626
cites work: Q4807830
cites work: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
cites work: Handbook of weighted automata
cites work: A Kleene-Schützenberger Theorem for Weighted Timed Automata
cites work: Fixed Point Theory
cites work: Q3431478
cites work: Q3431479
cites work: Q3624034
cites work: Q4503930
cites work: HyTech: A model checker for hybrid systems
cites work: Q3704880
cites work: Uppaal in a nutshell
cites work: Foundations of Software Science and Computational Structures
cites work: Q4953404
cites work: On the Supports of Recognizable Timed Series
cites work: Weighted Timed MSO Logics
cites work: Q3574978
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Q4155837
cites work: On the definition of a family of automata
DOI: 10.1016/J.TCS.2010.12.033
description: scientific article; zbMATH DE number 5865597