Search

• < Previous
• 1
• Next >

Coarse abstractions make Zeno behaviours difficult to detect

An infinite run of a timed automaton is Zeno if it spans only a finite amount of time. Such runs are considered unfeasible and hence it is important to detect them, or dually, find runs that are non-Zeno. Over the years important improvements have been obtained in checking reachability properties&nbsp;[&hellip;]