Browse Research and Tech Reports - Computer Science by Subject "Boolean Automata"

  • Chadha, Rohit; Legay, Axel; Prabhakar, Pavithra; Viswanathan, Mahesh (Springer Verlag, 2009)
    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 ...


    application/pdfPDF (232kB)