Folgen
Martin Helfrich
Titel
Zitiert von
Zitiert von
Jahr
Automata tutor v3
L D’Antoni, M Helfrich, J Kretinsky, E Ramneantu, M Weininger
Computer Aided Verification: 32nd International Conference, CAV 2020, Los …, 2020
192020
Succinct population protocols for presburger arithmetic
M Blondin, J Esparza, B Genest, M Helfrich, S Jaax
37th International Symposium on Theoretical Aspects of Computer Science …, 2020
182020
Checking qualitative liveness properties of replicated systems with stochastic scheduling
M Blondin, J Esparza, M Helfrich, A Kučera, PJ Meyer
International Conference on Computer Aided Verification, 372-397, 2020
82020
Fast and Succinct Population Protocols for Presburger Arithmetic
P Czerner, R Guttenberg, M Helfrich, J Esparza
1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022
62022
Peregrine 2.0: Explaining correctness of population protocols through stage graphs
J Esparza, M Helfrich, S Jaax, PJ Meyer
International Symposium on Automated Technology for Verification and …, 2020
52020
Abstraction-Based Segmental Simulation of Chemical Reaction Networks
M Helfrich, M Češka, J Křetínský, Š Martiček
International Conference on Computational Methods in Systems Biology, 41-60, 2022
32022
Efficient Analysis of Population Protocols and Chemical Reaction Networks
M Helfrich
Technische Universität München, 2023
2023
Decision Power of Weak Asynchronous Models of Distributed Computing
P Czerner, R Guttenberg, M Helfrich, J Esparza
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021
2021
Automatic Verification of non-silent Population Protocols
M Helfrich
2019
Kontextfreie Grammatiken in AutomataTutor
M Helfrich
2017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–10