Balanced timed regular expressions
From MaRDI portal
Recommendations
Cites work
- A theory of timed automata
- An algebraic characterization of data and timed languages
- Approximation and complexity: Liouvillean-type theorems for linear differential equations on an interval
- Decomposition and composition of timed automata
- scientific article; zbMATH DE number 1916671 (Why is no real title available?)
- scientific article; zbMATH DE number 805390 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Renaming is necessary in timed regular expressions
- Rewriting rules for synchronization languages
- Symbolic techniques for parametric reasoning about counter and clock systems
- Timed regular expressions
Cited in
(9)- On equivalences for a class of timed regular expressions
- Automated synthesis of enforcing mechanisms for security properties in a timed setting
- Timed regular expressions
- Regular expressions with timed dominoes
- Renaming is necessary in timed regular expressions
- A Survey on Analog Models of Computation
- A Kleene-Schützenberger Theorem for Weighted Timed Automata
- A Kleene-Schützenberger theorem for weighted timed automata
- Balanced-by-construction regular and -regular languages
This page was built for publication: Balanced timed regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842862)