Real-time automata
From MaRDI portal
Recommendations
Cited in
(21)- A study on shuffle, stopwatches and independently evolving clocks
- Detectability of labeled weighted automata over monoids
- scientific article; zbMATH DE number 3862435 (Why is no real title available?)
- scientific article; zbMATH DE number 177824 (Why is no real title available?)
- Efficiently identifying deterministic real-time automata from labeled data
- scientific article; zbMATH DE number 2050928 (Why is no real title available?)
- scientific article; zbMATH DE number 1500522 (Why is no real title available?)
- scientific article; zbMATH DE number 1870546 (Why is no real title available?)
- scientific article; zbMATH DE number 1916671 (Why is no real title available?)
- Learning one-clock timed automata
- Formal language properties of hybrid systems with strong resets
- Equivalence checking and intersection of deterministic timed finite state machines
- Active learning of one-clock timed automata using constraint solving
- State estimation for constant-time labeled automata under dense time
- Computing the bandwidth of meager timed automata
- Timed initial-state detectability of discrete-event systems by algebraic method
- Learning deterministic multi-clock timed automata
- Execution-time opacity problems in one-clock parametric timed automata
- The bright side of timed opacity
- Active learning of symbolic mealy automata
- On the complexity of timed pattern matching
This page was built for publication: Real-time automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2708466)
