A timed automaton is a mathematical model in automata theory that extends finite automata with a finite set of real-valued clocks. This formalism, introduced by Rajeev Alur and David Dill in 1994, enables the modeling of systems where timing constraints are crucial.
A timed automaton is a mathematical model in automata theory that extends finite automata with a finite set of real-valued clocks. This formalism, introduced by Rajeev Alur and David Dill in 1994, enables the modeling of systems where timing constraints are crucial.
Source: Wikipedia "Timed automaton" · CC BY-SA 4.0
Share this article: X · Bluesky