DOI,IST REx ID,Research Group,Title of publication
10.4230/LIPIcs.CONCUR.2023.21,14405,ToHe,Hypernode automata
10.1007/978-3-031-42697-1_2,14411,ToHe,"Phenotype control of partially specified boolean networks"
10.3233/FAIA230264,14518,"ToHe,KrCh",Reachability poorman discrete-bidding games
10.1007/978-3-031-45329-8_17,14559,"ToHe,KrCh","Learning provably stabilizing neural controllers for discrete-time stochastic systems"
10.1007/978-3-031-37709-9_1,14758,ToHe,"A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties"
10.1609/aaai.v37i10.26407,14830,"ToHe,KrCh",Learning control policies for stochastic systems with reach-avoid guarantees
10.46298/theoretics.23.4,14920,ToHe,Fast symbolic algorithms for mega-regular games under strong transition fairness
10.5281/ZENODO.7877790,14994,ToHe,A flexible toolchain for symbolic rabin games under fair and stochastic uncertainties
10.5281/ZENODO.8191723,15035,ToHe,Monitoring hyperproperties with prefix transducers
10.34727/2023/isbn.978-3-85448-060-0_20,14718,ToHe,Binary decision diagrams on modern hardware
10.1609/aaai.v37i5.25679,14243,"ToHe,KrCh",Bidding graph games with partially-observable budgets
10.1109/LRA.2023.3240930,12704,ToHe,Revisiting the adversarial robustness-accuracy tradeoff in robot learning
10.4230/LIPIcs.CONCUR.2023.17,13221,"GradSch,ToHe",Safety and liveness of quantitative automata
null,15023,"ToHe,KrCh",Compositional policy learning in stochastic control systems with formal guarantees
10.1007/978-3-031-37703-7_17,13310,"GradSch,ToHe",Monitoring algorithmic fairness
10.1145/3593013.3594028,13228,ToHe,Runtime monitoring of dynamic fairness properties
10.1007/978-3-031-44267-4_15,14454,ToHe,Monitoring algorithmic fairness under partial observations
10.1007/978-3-030-95561-8_1,10891,ToHe,Quantitative monitoring of software
10.1007/978-3-030-99429-7_1,11355,ToHe,Information-flow interfaces
10.1109/ICRA46639.2022.9811650,12010,ToHe,Latent imagination facilitates zero-shot transfer in autonomous racing