default search action
Arnd Hartmanns
Person information
- affiliation: University of Twente, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c54]Arnd Hartmanns
, Bram Kohlen
Efficient Formally Verified Maximal End Component Decomposition for MDPs. FM (1) 2024: 206-225 - [i12]Roman Andriushchenko, Alexander Bork, Carlos E. Budde, Milan Ceska, Kush Grover, Ernst Moritz Hahn, Arnd Hartmanns, Bryant Israelsen, Nils Jansen, Joshua Jeppson, Sebastian Junges, Maximilian A. Köhl, Bettina Könighofer, Jan Kretínský, Tobias Meggendorfer, David Parker, Stefan Pranger, Tim Quatmann, Enno Ruijters, Landon Taylor, Matthias Volk, Maximilian Weininger, Zhen Zhang:
Tools at the Frontiers of Quantitative Verification. CoRR abs/2405.13583 (2024) - 2023
- [c53]Arnd Hartmanns
Fast Verified SCCs for Probabilistic Model Checking. ATVA (1) 2023: 181-202 - [c52]Arnd Hartmanns
A Practitioner's Guide to MDP Model Checking Algorithms. TACAS (1) 2023: 469-488 - [i11]Arnd Hartmanns, Sebastian Junges, Tim Quatmann, Maximilian Weininger
A Practitioner's Guide to MDP Model Checking Algorithms. CoRR abs/2301.10197 (2023) - [i10]Marcus Gerhold, Arnd Hartmanns:
Reproduction Report for SV-COMP 2023. CoRR abs/2303.06477 (2023) - 2022
- [c51]Alessandro Abate, Henk A. P. Blom, Joanna Delicaris, Sofie Haesaert, Arnd Hartmanns, Birgit van Huijgevoort, Abolfazl Lavaei, Hao Ma, Mathis Niehage, Anne Remke, Oliver Schön
ARCH-COMP22 Category Report: Stochastic Models. ARCH@SAFECOMP 2022: 113-141 - [c50]Arnd Hartmanns
The Modest State of Learning, Sampling, and Verifying Strategies. ISoLA (3) 2022: 406-432 - [c49]Pedro R. D'Argenio
Comparing Statistical and Analytical Routing Approaches for Delay-Tolerant Networks. QEST 2022: 337-355 - [c48]Arnd Hartmanns
Correct Probabilistic Model Checking with Floating-Point Arithmetic. TACAS (2) 2022: 41-59 - [c47]Arnd Hartmanns:
An Overview of Modest Models and Tools for Real Stochastic Timed Systems. MARS@ETAPS 2022: 1-12 - [e1]Arnd Hartmanns, Ina Schaefer, Stefania Gnesi, Nico Plat:
10th IEEE/ACM International Conference on Formal Methods in Software Engineering, FormaliSE@ICSE 2022, Pittsburgh, PA, USA, May 22-23, 2022. ACM 2022, ISBN 978-1-4503-9287-7 [contents] - [i9]Arnd Hartmanns, Bram Kohlen:
Backwards Reachability for Probabilistic Timed Automata: A Replication Report. CoRR abs/2208.11928 (2022) - 2021
- [j10]Yuliya Butkova
A Modest Approach to Markov Automata. ACM Trans. Model. Comput. Simul. 31(3): 14:1-14:34 (2021) - [c46]Alessandro Abate, Henk A. P. Blom, Marc Bouissou, Nathalie Cauchi, Hassane Chraibi, Joanna Delicaris, Sofie Haesaert, Arnd Hartmanns, Mahmoud Khaled, Abolfazl Lavaei, Hao Ma, Kaushik Mallik, Mathis Niehage, Anne Remke, Stefan Schupp, Fedor Shmarov, Sadegh Soudjani, Adam J. Thorpe, Vlad Turcuman, Paolo Zuliani:
ARCH-COMP21 Category Report: Stochastic Models. ARCH@ADHS 2021: 55-89 - [c45]Riley Roberts
Probabilistic Verification for Reliability of a Two-by-Two Network-on-Chip System. FMICS 2021: 232-248 - [c44]Mathis Niehage, Arnd Hartmanns, Anne Remke:
Learning optimal decisions for stochastic hybrid systems. MEMOCODE 2021: 44-55 - [c43]Thom S. Badings
Balancing Wind and Batteries: Towards Predictive Verification of Smart Grids. NFM 2021: 1-18 - [c42]Arnd Hartmanns
Tweaking the Odds in Probabilistic Timed Automata. QEST 2021: 39-58 - [c41]Ernst Moritz Hahn, Arnd Hartmanns:
Symblicit exploration and elimination for probabilistic model checking. SAC 2021: 1798-1806 - [c40]Carlos E. Budde
Replicating sc Restart with Prolonged Retrials: An Experimental Report. TACAS (2) 2021: 373-380 - [i8]Thom S. Badings, Arnd Hartmanns, Nils Jansen, Marnix Suilen:
Balancing Wind and Batteries: Towards Predictive Verification of Smart Grids. CoRR abs/2101.12496 (2021) - [i7]Riley Roberts, Benjamin Lewis, Arnd Hartmanns, Prabal Basu, Sanghamitra Roy, Koushik Chakraborty, Zhen Zhang:
Probabilistic Verification for Reliability of a Two-by-Two Network-on-Chip System. CoRR abs/2108.13148 (2021) - [i6]Arnd Hartmanns:
Correct Probabilistic Model Checking with Floating-Point Arithmetic. CoRR abs/2110.08785 (2021) - 2020
- [j9]Arnd Hartmanns
Multi-cost Bounded Tradeoff Analysis in MDP. J. Autom. Reason. 64(7): 1483-1522 (2020) - [j8]Carlos E. Budde
An efficient statistical model checker for nondeterminism and rare events. Int. J. Softw. Tools Technol. Transf. 22(6): 759-780 (2020) - [c39]Alessandro Abate, Henk A. P. Blom, Nathalie Cauchi, Joanna Delicaris, Arnd Hartmanns, Mahmoud Khaled, Abolfazl Lavaei, Carina Pilch, Anne Remke, Stefan Schupp, Fedor Shmarov, Sadegh Soudjani, Abraham P. Vinod, Ben Wooding
ARCH-COMP20 Category Report: Stochastic Models. ARCH 2020: 76-106 - [c38]Arnd Hartmanns
Optimistic Value Iteration. CAV (2) 2020: 488-511 - [c37]Carina Pilch, Arnd Hartmanns, Anne Remke:
Classic and non-prophetic model checking for hybrid Petri nets with stochastic firings. HSCC 2020: 10:1-10:11 - [c36]Carlos E. Budde
On Correctness, Precision, and Performance in Quantitative Verification - QComp 2020 Competition Report. ISoLA (4) 2020: 216-241 - [c35]Pedro R. D'Argenio
Sampling Distributed Schedulers for Resilient Space Communication. NFM 2020: 291-310 - [i5]Ernst Moritz Hahn, Arnd Hartmanns:
Symblicit Exploration and Elimination for Probabilistic Model Checking. CoRR abs/2001.04289 (2020)
2010 – 2019
- 2019
- [j7]Marcus Gerhold
Model-based testing of stochastically timed systems. Innov. Syst. Softw. Eng. 15(3-4): 207-233 (2019) - [j6]Carlos E. Budde
Automated compositional importance splitting. Sci. Comput. Program. 174: 90-108 (2019) - [c34]Benjamin Lewis
Probabilistic Verification for Reliable Network-on-Chip System Design. FMICS 2019: 110-126 - [c33]Yuliya Butkova
A Modest Approach to Modelling and Checking Markov Automata. QEST 2019: 52-69 - [c32]Arnd Hartmanns
A Modest Markov Automata Tutorial. RW 2019: 250-276 - [c31]Ezio Bartocci
TOOLympics 2019: An Overview of Competitions in Formal Methods. TACAS (3) 2019: 3-24 - [c30]Ernst Moritz Hahn
The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models - (QComp 2019 Competition Report). TACAS (3) 2019: 69-92 - [c29]Arnd Hartmanns
The Quantitative Verification Benchmark Set. TACAS (1) 2019: 344-350 - [i4]Arnd Hartmanns, Benjamin Lucien Kaminski:
Optimistic Value Iteration. CoRR abs/1910.01100 (2019) - 2018
- [c28]Alessandro Abate, Henk A. P. Blom
ARCH-COMP18 Category Report: Stochastic Modelling. ARCH@ADHS 2018: 71-103 - [c27]Pedro R. D'Argenio
A Hierarchy of Scheduler Classes for Stochastic Automata. FoSSaCS 2018: 384-402 - [c26]Pedro R. D'Argenio
Lightweight Statistical Model Checking in Nondeterministic Continuous Time. ISoLA (2) 2018: 336-353 - [c25]Marcus Gerhold
Model-Based Testing for General Stochastic Time. NFM 2018: 203-219 - [c24]Arnd Hartmanns
Multi-cost Bounded Reachability in MDP. TACAS (2) 2018: 320-339 - [c23]Carlos E. Budde
A Statistical Model Checker for Nondeterminism and Rare Events. TACAS (2) 2018: 340-358 - 2017
- [c22]Alexander Graf-Brill, Arnd Hartmanns
Modelling and certification for electric mobility. INDIN 2017: 109-114 - [c21]Carlos E. Budde
Better Automated Importance Splitting for Transient Rare Events. SETTA 2017: 42-58 - [c20]Carlos E. Budde
JANI: Quantitative Model and Tool Interaction. TACAS (2) 2017: 151-168 - [c19]Arnd Hartmanns
Efficient simulation-based verification of probabilistic timed automata. WSC 2017: 1419-1430 - [i3]Pedro R. D'Argenio, Marcus Gerhold, Arnd Hartmanns, Sean Sedwards:
A Hierarchy of Scheduler Classes for Stochastic Automata. CoRR abs/1710.05763 (2017) - 2016
- [c18]Arnd Hartmanns
Schedulers are no Prophets. Semantics, Logics, and Calculi 2016: 214-235 - [c17]Arnd Hartmanns
Flexible support for time and costs in scenario-aware dataflow. EMSOFT 2016: 3:1-3:10 - [c16]Pedro R. D'Argenio
Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata. IFM 2016: 99-114 - [c15]Ernst Moritz Hahn, Arnd Hartmanns
A Comparison of Time- and Reward-Bounded Probabilistic Model Checking Techniques. SETTA 2016: 85-100 - [i2]Ernst Moritz Hahn, Arnd Hartmanns:
Efficient Algorithms for Time- and Cost-Bounded Probabilistic Model Checking. CoRR abs/1605.05551 (2016) - 2015
- [b1]Arnd Hartmanns:
On the analysis of stochastic timed systems. Saarland University, 2015, pp. 1-341 - [j5]Arnd Hartmanns
In the quantitative automata zoo. Sci. Comput. Program. 112: 3-23 (2015) - [j4]Arnd Hartmanns
Sound statistical model checking for MDP using partial order and confluence reduction. Int. J. Softw. Tools Technol. Transf. 17(4): 429-456 (2015) - [c14]Arnd Hartmanns
Explicit Model Checking of Very Large MDP Using Partitioning and Secondary Storage. ATVA 2015: 131-147 - [c13]Freek van den Berg, Jozef Hooman, Arnd Hartmanns
Computing Response Time Distributions Using Iterative Probabilistic Model Checking. EPEW 2015: 208-224 - [i1]Arnd Hartmanns, Holger Hermanns:
Explicit Model Checking of Very Large MDP using Partitioning and Secondary Storage. CoRR abs/1504.02861 (2015) - 2014
- [j3]Ernst Moritz Hahn, Arnd Hartmanns, Holger Hermanns
Reachability and Reward Checking for Stochastic Timed Automata. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014) - [c12]Arnd Hartmanns
The Modest Toolset: An Integrated Environment for Quantitative Modelling and Verification. TACAS 2014: 593-598 - 2013
- [j2]Ernst Moritz Hahn, Arnd Hartmanns
A compositional modelling and analysis framework for stochastic hybrid systems. Formal Methods Syst. Des. 43(2): 191-232 (2013) - [j1]Holger Hermanns
An Internet Inspired Approach to Power Grid Stability. it Inf. Technol. 55(2): 45-51 (2013) - [c11]Arnd Hartmanns
On-the-Fly Confluence Detection for Statistical Model Checking. NASA Formal Methods 2013: 337-351 - 2012
- [c10]Birgit Vogel-Heuser
Modeling of Networked Automation Systems for simulation and model checking of time behavior. SSD 2012: 1-5 - [c9]Marius Bozga, Alexandre David, Arnd Hartmanns
State-of-the-art tools and techniques for quantitative modeling and analysis of embedded systems. DATE 2012: 370-375 - [c8]Arnd Hartmanns:
MODEST - A unified language for quantitative models. FDL 2012: 44-51 - [c7]Arnd Hartmanns
Modelling and Decentralised Runtime Control of Self-stabilising Power Micro Grids. ISoLA (1) 2012: 420-439 - [c6]Jonathan Bogdoll, Arnd Hartmanns
Simulation and Statistical Model Checking for Modestly Nondeterministic Models. MMB/DFT 2012: 249-252 - [c5]Jonathan Bogdoll, Alexandre David, Arnd Hartmanns
mctau: Bridging the Gap between Modest and UPPAAL. SPIN 2012: 227-233 - [c4]Arnd Hartmanns
A comparative analysis of decentralized power grid stabilization strategies. WSC 2012: 158:1-158:13 - 2011
- [c3]Jonathan Bogdoll, Luis María Ferrer Fioriti, Arnd Hartmanns
Partial Order Methods for Statistical Model Checking and Simulation. FMOODS/FORTE 2011: 59-74 - 2010
- [c2]Arnd Hartmanns
Model-Checking and Simulation for Stochastic Timed Systems. FMCO 2010: 372-391
2000 – 2009
- 2009
- [c1]Arnd Hartmanns
A Modest Approach to Checking Probabilistic Timed Automata. QEST 2009: 187-196
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: