Timed Automata with Polynomial Delay and their Expressiveness

2017/03/27 by Valentin Bura, Bura, Valentin, Tim French +3
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1703.08936

openalex publication_date 2017/03/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• A theory of timed automata

Related

• Trace Expressiveness of Timed and Probabilistic Automata
• A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
• Finite Automata with Time-Delay Blocks (Extended Version)
• Interrupt Timed Automata with Auxiliary Clocks and Parameters
• Selected Topics in Asynchronous Automata