2000 character limit reached
Timed Automata with Polynomial Delay and their Expressiveness
Published 27 Mar 2017 in cs.LO | (1703.08936v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.