Timed automata extend finite-state models with clocks, making it possible to represent and verify timing constraints in real-time systems. Understand their core mechanics, the abstractions used to manage infinite state spaces, and the practical limits of model checking.
Articles Tagged: timed automata
Non-Intrusive Runtime Verification for Embedded Systems
High-volume execution traces can make real-time verification difficult for embedded systems. A layered approach using event filtering, timed automata and automata processors offers a way to monitor requirements without relying on software instrumentation.