The target discounted-sum problem U Boker, TA Henzinger, J Otop 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 750-761, 2015 | 37 | 2015 |
Distributed synthesis for LTL fragments K Chatterjee, TA Henzinger, J Otop, A Pavlogiannis 2013 Formal Methods in Computer-Aided Design, 18-25, 2013 | 34 | 2013 |
From model checking to model measuring TA Henzinger, J Otop International Conference on Concurrency Theory, 273-287, 2013 | 33 | 2013 |
Nested weighted automata K Chatterjee, TA Henzinger, J Otop ACM Transactions on Computational Logic (TOCL) 18 (4), 1-44, 2017 | 29 | 2017 |
Quantitative monitor automata K Chatterjee, TA Henzinger, J Otop International Static Analysis Symposium, 23-38, 2016 | 24 | 2016 |
Quantitative automata under probabilistic semantics K Chatterjee, TA Henzinger, J Otop Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 16* | 2016 |
Lipschitz robustness of finite-state transducers TA Henzinger, J Otop, R Samanta arXiv preprint arXiv:1404.6452, 2014 | 15 | 2014 |
Learning deterministic automata on infinite words J Michaliszyn, J Otop ECAI 2020, 2370-2377, 2020 | 11 | 2020 |
Edit distance for pushdown automata K Chatterjee, TA Henzinger, R Ibsen-Jensen, J Otop Logical Methods in Computer Science 13, 2017 | 10 | 2017 |
Lipschitz robustness of timed I/O systems TA Henzinger, J Otop, R Samanta International Conference on Verification, Model Checking, and Abstract …, 2015 | 9 | 2015 |
Model measuring for hybrid systems TA Henzinger, J Otop Proceedings of the 17th international conference on Hybrid systems …, 2014 | 9 | 2014 |
Decidable elementary modal logics J Michaliszyn, J Otop 2012 27th Annual IEEE Symposium on Logic in Computer Science, 491-500, 2012 | 9 | 2012 |
Modal logics definable by universal three-variable formulas E Kieronski, J Michaliszyn, J Otop IARCS Annual Conference on Foundations of Software Technology and …, 2011 | 9 | 2011 |
Nested weighted limit-average automata of bounded width K Chatterjee, TA Henzinger, J Otop arXiv preprint arXiv:1606.03598, 2016 | 8 | 2016 |
Learning infinite-word automata with loop-index queries J Michaliszyn, J Otop Artificial Intelligence 307, 103710, 2022 | 7 | 2022 |
Quantitative fair simulation games K Chatterjee, TA Henzinger, J Otop, Y Velner Information and Computation 254, 143-166, 2017 | 7 | 2017 |
Learning deterministic visibly pushdown automata under accessible stack J Michaliszyn, J Otop 47th International Symposium on Mathematical Foundations of Computer Science …, 2022 | 5 | 2022 |
Non-deterministic weighted automata evaluated over Markov chains J Michaliszyn, J Otop Journal of Computer and System Sciences 108, 118-136, 2020 | 5 | 2020 |
Approximate learning of limit-average automata J Michaliszyn, J Otop arXiv preprint arXiv:1906.11104, 2019 | 5 | 2019 |
Model measuring for discrete and hybrid systems TA Henzinger, J Otop Nonlinear Analysis: Hybrid Systems 23, 166-190, 2017 | 5 | 2017 |