Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
393 Publications
2023 |Published| Journal Article | IST-REx-ID: 14920 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. Banerjee, R. Majumdar, K. Mallik, A.-K. Schmuck, and S. Soudjani, “Fast symbolic algorithms for mega-regular games under strong transition fairness,” TheoretiCS, vol. 2. EPI Sciences, 2023.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 14411 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
N. Beneš, L. Brim, S. Pastva, D. Šafránek, and E. Šmijáková, “Phenotype control of partially specified boolean networks,” in 21st International Conference on Computational Methods in Systems Biology, Luxembourg City, Luxembourg, 2023, vol. 14137, pp. 18–35.
[Submitted Version]
View
| Files available
| DOI
2023 |Published| Conference Paper | IST-REx-ID: 14758 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties,” in 35th International Conference on Computer Aided Verification, Paris, France, 2023, vol. 13966, pp. 3–15.
[Published Version]
View
| Files available
| DOI
2023 | Research Data Reference | IST-REx-ID: 14994 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
R. Majumdar, K. Mallik, M. Rychlicki, A.-K. Schmuck, and S. Soudjani, “A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties.” Zenodo, 2023.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2023 |Published| Conference Paper | IST-REx-ID: 14076 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers,” in 23nd International Conference on Runtime Verification, Thessaloniki, Greek, 2023, vol. 14245, pp. 168–190.
[Published Version]
View
| Files available
| DOI
2023 | Research Data Reference | IST-REx-ID: 15035 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Chalupa and T. A. Henzinger, “Monitoring hyperproperties with prefix transducers.” Zenodo, 2023.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2023 |Published| Conference Paper | IST-REx-ID: 13228 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. A. Henzinger, M. Karimi, K. Kueffner, and K. Mallik, “Runtime monitoring of dynamic fairness properties,” in FAccT ’23: Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, Chicago, IL, United States, 2023, pp. 604–614.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 15023 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in 37th Conference on Neural Information Processing Systems, New Orleans, LO, United States, 2023.
[Published Version]
View
| Files available
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 10774 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. O. Da Costa, “Flavors of sequential information flow,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Philadelphia, PA, United States, 2022, vol. 13182, pp. 1–19.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 12010 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Brunnbauer et al., “Latent imagination facilitates zero-shot transfer in autonomous racing,” in 2022 International Conference on Robotics and Automation, Philadelphia, PA, United States, 2022, pp. 7513–7520.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 12171 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Garcia Soto, T. A. Henzinger, and C. Schilling, “Synthesis of parametric hybrid automata from time series,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 337–353.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 12508 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. A. Henzinger, K. Lehtinen, and P. Totzke, “History-deterministic timed automata,” in 33rd International Conference on Concurrency Theory, Warsaw, Poland, 2022, vol. 243, p. 14:1-14:21.
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 12509 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
G. Avni and T. A. Henzinger, “An updated survey of bidding games on graphs,” in 47th International Symposium on Mathematical Foundations of Computer Science, Vienna, Austria, 2022, vol. 241, p. 3:1-3:6.
[Published Version]
View
| Files available
| DOI
2022 |Submitted| Preprint | IST-REx-ID: 11366 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Lechner, A. Amini, D. Rus, and T. A. Henzinger, “Revisiting the adversarial robustness-accuracy tradeoff in robot learning,” arXiv. .
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 11775 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Abstract monitors for quantitative specifications,” in 22nd International Conference on Runtime Verification, Tbilisi, Georgia, 2022, vol. 13498, pp. 200–220.
[Published Version]
View
| Files available
| DOI
| WoS
2022 |Published| Journal Article | IST-REx-ID: 12147 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
R. Hasani et al., “Closed-form continuous-time neural networks,” Nature Machine Intelligence, vol. 4, no. 11. Springer Nature, pp. 992–1003, 2022.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 |Published| Thesis | IST-REx-ID: 11362 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Lechner, “Learning verifiable representations,” Institute of Science and Technology Austria, 2022.
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 12302 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Doveri, P. Ganty, and N. A. Mazzocchi, “FORQ-based language inclusion formal testing,” in Computer Aided Verification, Haifa, Israel, 2022, vol. 13372, pp. 109–129.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 12175 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
S. Bose, T. A. Henzinger, K. Lehtinen, S. Schewe, and P. Totzke, “History-deterministic timed automata are not determinizable,” in 16th International Conference on Reachability Problems, Kaiserslautern, Germany, 2022, vol. 13608, pp. 67–76.
[Preprint]
View
| DOI
| Download Preprint (ext.)