Decomposition and composition of timed automata

DOI10.1007/3-540-48523-6_18MaRDI QIDQ4938626zbMATH OpenFDO

Authors Patricia Bouyer, A. Petit

Publication date 23 February 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48523-6_18

zbMATH Keywords

timed automata

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 1543316
• A theory of timed automata
• Foundations of Software Science and Computation Structures
• Decomposing timed push down automata
• Timed regular expressions

Cited in

(15)

• A Kleene theorem for splitable signals
• An algebraic approach to data languages and timed languages
• A logical characterization of data languages.
• A study on shuffle, stopwatches and independently evolving clocks
• Decomposing timed push down automata
• Balanced timed regular expressions
• scientific article; zbMATH DE number 3570372 (Why is no real title available?)
• scientific article; zbMATH DE number 1543316 (Why is no real title available?)
• scientific article; zbMATH DE number 1916671 (Why is no real title available?)
• Structural transformations for data-enriched real-time systems
• A Survey on Analog Models of Computation
• Decomposition of timed automata for solving scheduling problems
• scientific article; zbMATH DE number 5201490 (Why is no real title available?)
• A Kleene-Schützenberger Theorem for Weighted Timed Automata
• A Kleene-Schützenberger theorem for weighted timed automata

This page was built for publication: Decomposition and composition of timed automata

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