Timed Automata with Polynomial Delay and their Expressiveness
Valentin Bura, Tim French, Mark Reynolds
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.
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.
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, programming, and type systems · semigroups and automata theory