Lipschitz Robustness of Timed I/O Systems
We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of uncertain inputs and formalize their robustness using the analytic notion of Lipschitz continuity: a timed I/O system is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions over timed words such as the timed version of the Manhattan distance and the Skorokhod distance. We consider two models of timed I/O systems — timed transducers and asynchronous sequential circuits. We show that K-robustness of timed transducers can be decided in polynomial space under certain conditions. For asynchronous sequential circuits, we reduce K-robustness w.r.t. timed Manhattan distances to K-robustness of discrete letter-to-letter transducers and show PSpace-completeness of the problem.
- 3.Bloem, R., Greimel, K., Henzinger, T., Jobstmann, B.: Synthesizing robust systems. In: Formal Methods in Computer Aided Design (FMCAD), pp. 85–92 (2009)Google Scholar
- 7.Chaudhuri, S., Gulwani, S., Lublinerman, R.: Continuity analysis of programs. In: Principles of Programming Languages (POPL), pp. 57–70 (2010)Google Scholar
- 8.Chaudhuri, S., Gulwani, S., Lublinerman, R., Navidpour, S.: Proving programs robust. In: Foundations of Software Engineering (FSE), pp. 102–112 (2011)Google Scholar
- 9.Doyen, L., Henzinger, T.A., Legay, A., Ničković, D.: Robustness of sequential circuits. In: Application of Concurrency to System Design (ACSD), pp. 77–84 (2010)Google Scholar
- 12.Henzinger, T.A., Otop, J., Samanta, R.: Lipschitz robustness of finite-state transducers. In: FSTTCS 2014, vol. 1, p. 431 (2014)Google Scholar
- 17.Majumdar, R., Saha, I.: Symbolic robustness analysis. In: IEEE Real-Time Systems Symposium, pp. 355–363 (2009)Google Scholar