Seguir
Simon Jantsch
Título
Citado por
Citado por
Año
From verification to causality-based explications
C Baier, C Dubslaff, F Funke, S Jantsch, R Majumdar, J Piribauer, ...
arXiv preprint arXiv:2105.09533, 2021
372021
Farkas certificates and minimal witnesses for probabilistic reachability constraints
F Funke, S Jantsch, C Baier
International Conference on Tools and Algorithms for the Construction and …, 2020
162020
Causality-based game solving
C Baier, N Coenen, B Finkbeiner, F Funke, S Jantsch, J Siber
International Conference on Computer Aided Verification, 894-917, 2021
132021
Reachability in dynamical systems with rounding
C Baier, F Funke, S Jantsch, T Karimov, E Lefaucheux, J Ouaknine, ...
arXiv preprint arXiv:2009.13353, 2020
72020
Probabilistic causes in Markov chains
C Baier, F Funke, S Jantsch, J Piribauer, R Ziemek
International Symposium on Automated Technology for Verification and …, 2021
62021
The Orbit Problem for parametric linear dynamical systems
C Baier, F Funke, S Jantsch, T Karimov, E Lefaucheux, F Luca, ...
arXiv preprint arXiv:2104.10634, 2021
62021
From LTL to unambiguous Büchi automata via disambiguation of alternating automata
S Jantsch, D Müller, C Baier, J Klein
International Symposium on Formal Methods, 262-279, 2019
62019
Probabilistic causes in Markov chains
R Ziemek, J Piribauer, F Funke, S Jantsch, C Baier
Innovations in Systems and Software Engineering 18 (3), 347-367, 2022
52022
Responsibility and verification: Importance value in temporal logics
C Mascle, C Baier, F Funke, S Jantsch, S Kiefer
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-14, 2021
52021
Minimal witnesses for probabilistic timed automata
S Jantsch, F Funke, C Baier
International Symposium on Automated Technology for Verification and …, 2020
52020
Operational Causality–Necessarily Sufficient and Sufficiently Necessary
C Baier, C Dubslaff, F Funke, S Jantsch, J Piribauer, R Ziemek
A Journey from Process Algebra via Timed Automata to Model Learning: Essays …, 2022
42022
Determinization and limit-determinization of emerson-lei automata
T John, S Jantsch, C Baier, S Klüppelholz
International Symposium on Automated Technology for Verification and …, 2021
42021
A unifying formal approach to importance values in Boolean functions
H Harder, S Jantsch, C Baier, C Dubslaff
arXiv preprint arXiv:2305.08103, 2023
32023
From Emerson-Lei automata to deterministic, limit-deterministic or good-for-MDP automata
T John, S Jantsch, C Baier, S Klüppelholz
Innovations in Systems and Software Engineering 18 (3), 385-403, 2022
32022
SWITSS: computing small witnessing subsystems
S Jantsch, H Harder, F Funke, C Baier
arXiv preprint arXiv:2008.04049, 2020
32020
Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata
S Jantsch, M Norrish
Interactive Theorem Proving: 9th International Conference, ITP 2018, Held as …, 2018
32018
Certificates and Witnesses for Probabilistic Model Checking
S Jantsch
22022
Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
C Baier, F Funke, S Jantsch, T Karimov, E Lefaucheux, J Ouaknine, ...
33rd International Conference on Concurrency Theory (CONCUR 2022), 2022
12022
From LTL to unambiguous Büchi automata via disambiguation of alternating automata
S Jantsch, D Müller, C Baier, J Klein
Formal Methods in System Design 58 (1), 42-82, 2021
12021
Witnessing subsystems for probabilistic systems with low tree width
S Jantsch, J Piribauer, C Baier
arXiv preprint arXiv:2108.08070, 2021
12021
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20