A Kleene-Schützenberger Theorem for Weighted Timed Automata

DOI10.1007/978-3-540-78499-9_11MaRDI QIDQ5458356zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A Kleene-Schützenberger theorem for weighted timed automata
• Kleene-Schützenberg and Büchi theorems for weighted timed automata.
• Weighted automata with discounting
• On the supports of recognizable timed series
• A Nivat theorem for weighted timed automata and weighted relative distance logic

Cites work

• scientific article; zbMATH DE number 3932372 (Why is no real title available?)
• scientific article; zbMATH DE number 41838 (Why is no real title available?)
• scientific article; zbMATH DE number 3588051 (Why is no real title available?)
• scientific article; zbMATH DE number 1794360 (Why is no real title available?)
• scientific article; zbMATH DE number 1794367 (Why is no real title available?)
• scientific article; zbMATH DE number 1916671 (Why is no real title available?)
• scientific article; zbMATH DE number 1405646 (Why is no real title available?)
• A theory of timed automata
• Automata, Languages and Programming
• Balanced timed regular expressions
• Formal Methods for the Design of Real-Time Systems
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Foundations of Software Science and Computational Structures
• HyTech: A model checker for hybrid systems
• Hybrid systems: computation and control. 4th international workshop, HSCC 2001, Rome, Italy, March 28--30, 2001. Proceedings
• Improved undecidability results on weighted timed automata
• Model-Checking One-Clock Priced Timed Automata
• Modelling mixed discrete-continuous domains for planning
• On the definition of a family of automata
• On the optimal reachability problem of weighted timed automata
• Optimal infinite scheduling for multi-priced timed automata
• Timed regular expressions
• Tools and Algorithms for the Construction and Analysis of Systems
• Uppaal in a nutshell
• Weighted automata and weighted logics

Cited in

(13)

• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• A Nivat theorem for weighted timed automata and weighted relative distance logic
• A Kleene-Schützenberger theorem for weighted timed automata
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• On the optimal reachability problem of weighted timed automata
• A Chomsky-Schützenberger Theorem for Weighted Automata with Storage
• Iteration Semirings
• Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
• On the Interval-Bound Problem for Weighted Timed Automata
• MSO logics for weighted timed automata
• Weighted Timed MSO Logics
• On the supports of recognizable timed series
• Kleene-Schützenberg and Büchi theorems for weighted timed automata.

Describes a project that uses

Uses Software

• HyTech

This page was built for publication: A Kleene-Schützenberger Theorem for Weighted Timed Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458356)