# Timed Automata with Polynomial Delay and their Expressiveness

## TL;DR

This paper introduces Timed Automata with Polynomial Delay, compares their expressiveness to existing models, and provides a formal characterization of their capabilities relative to Timed, Probabilistic, and Stochastic Timed Automata.

## Contribution

The paper presents a new model of Timed Automata with Polynomial Delay and analyzes its expressiveness compared to existing automata models.

## Key findings

- Polynomial Delay automata have distinct expressiveness properties.
- The models are characterized relative to each other.
- Formal relationships between models are established.

## 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.