English

Timed Automata with Polynomial Delay and their Expressiveness

Logic in Computer Science 2019-03-19 v2

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.

Keywords

Cite

@article{arxiv.1703.08936,
  title  = {Timed Automata with Polynomial Delay and their Expressiveness},
  author = {Valentin Bura and Tim French and Mark Reynolds},
  journal= {arXiv preprint arXiv:1703.08936},
  year   = {2019}
}

Comments

possibly incorrect, or unsubstantiated results and claims

R2 v1 2026-06-22T18:57:28.597Z