A Kleene-Schützenberger Theorem for Weighted Timed Automata

DOI10.1007/978-3-540-78499-9_11zbMATH Open1139.68031OpenAlexW1553601846MaRDI QIDQ5458356FDOQ5458356

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

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
• Weighted Timed MSO Logics
• MSO logics for weighted timed automata
• On the supports of recognizable timed series
• Kleene-Schützenberg and Büchi theorems for weighted timed automata.

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)