Automata for a decidable subset of duration calculus.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 512815
- Decidability of a hybrid duration calculus
- Automata and temporal logic over arbitrary linear time
- Formalizing decidability theorems about automata
- On the completeness and decidability of duration calculus with iteration
- scientific article; zbMATH DE number 4769
- Decidable approximations on generalized and parameterized discrete timed automata
- A decidable extension of data automata
- Decidability and complexity results for timed automata and semi-linear hybrid automta
Cited in
(2)
This page was built for publication: Automata for a decidable subset of duration calculus.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2737553)