Download now Free registration required
The authors present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, which arise naturally in the verification of timed software systems. The authors 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. The authors' proof techniques also establish complexity results for boolean programs, which are automata with stores that have additional boolean variables.
- Format: PDF
- Size: 226.3 KB