A dynamic algorithm for approximate flow computations

Pavithra Prabhakar and Mahesh Viswanathan

We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software systems. We model timed software systems as timed automata augmented with a data store (like a pushdown stack) and show that there is at least an exponential blowup in complexity of verification when compared with untimed systems. Our proof techniques also establish complexity results for boolean programs, which are automata with stores that have additional boolean variables.

14th ACM International Conference on Hybrid Systems: Computation and Control (HSCC), 2011
Download: BIB PS PDF