On the Supports of Recognizable Timed Series

DOI10.1007/978-3-642-04368-0_19zbMath1262.68094OpenAlexW1507081797MaRDI QIDQ3648835

Karin Quaas

Publication date: 1 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04368-0_19

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

A Kleene-Schützenberger theorem for weighted timed automata

Cites Work

• 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
• On the optimal reachability problem of weighted timed automata
• Optimal reachability for multi-priced timed automata
• Optimal infinite scheduling for multi-priced timed automata
• On model-checking timed automata with stopwatch observers
• Costs Are Expensive!
• Quantitative Languages
• The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable
• Weighted Timed MSO Logics
• A Kleene-Schützenberger Theorem for Weighted Timed Automata
• Formal Methods for the Design of Real-Time Systems
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: On the Supports of Recognizable Timed Series