@dblp

Let's Be Lazy, We Have Time - Or, Lazy Reachability Analysis for Timed Automata.

, and . FORMATS, volume 10419 of Lecture Notes in Computer Science, page 247-263. Springer, (2017)

Links and resources

Tags