Timed Automata with Polynomial Delay and their Expressiveness
classification
💻 cs.LO
keywords
timedautomatadelayexpressivenessmodelspolynomialcharacterizeconsider
read the original abstract
We consider previous models of Timed, Probabilistic and Stochastic Timed Automata, we introduce our model of Timed Automata with Polynomial Delay and we characterize the expressiveness of these models relative to each other.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.