The probabilistic model checker Storm

We present the probabilistic model checker Storm . Storm supports the analysis of discrete- and continuous-time variants of both Markov chains and Markov decision processes. Storm has three major distinguishing features. It supports multiple input languages for Markov models, including the Jani and...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal on software tools for technology transfer Ročník 24; číslo 4; s. 589 - 610
Hlavní autori:	Hensel, Christian, Junges, Sebastian, Katoen, Joost-Pieter, Quatmann, Tim, Volk, Matthias
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2022 Springer Nature B.V
Predmet:	Algorithms Awards & honors Command languages Competitions and Challenges Computer Science Empirical analysis Fault trees Languages Markov analysis Markov chains Petri nets Probabilistic models Probability theory Rapid prototyping Software Engineering Software Engineering/Programming and Operating Systems Theory of Computation Markov chain Model checking Markov decision process Verification Probilistic systems
ISSN:	1433-2779, 1433-2787
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	We present the probabilistic model checker Storm . Storm supports the analysis of discrete- and continuous-time variants of both Markov chains and Markov decision processes. Storm has three major distinguishing features. It supports multiple input languages for Markov models, including the Jani and Prism modeling languages, dynamic fault trees, generalized stochastic Petri nets, and the probabilistic guarded command language. It has a modular setup in which solvers and symbolic engines can easily be exchanged. Its Python API allows for rapid prototyping by encapsulating Storm ’s fast and scalable algorithms. This paper reports on the main features of Storm and explains how to effectively use them. A description is provided of the main distinguishing functionalities of Storm . Finally, an empirical evaluation of different configurations of Storm on the QComp 2019 benchmark set is presented.
AbstractList	We present the probabilistic model checker Storm . Storm supports the analysis of discrete- and continuous-time variants of both Markov chains and Markov decision processes. Storm has three major distinguishing features. It supports multiple input languages for Markov models, including the Jani and Prism modeling languages, dynamic fault trees, generalized stochastic Petri nets, and the probabilistic guarded command language. It has a modular setup in which solvers and symbolic engines can easily be exchanged. Its Python API allows for rapid prototyping by encapsulating Storm ’s fast and scalable algorithms. This paper reports on the main features of Storm and explains how to effectively use them. A description is provided of the main distinguishing functionalities of Storm . Finally, an empirical evaluation of different configurations of Storm on the QComp 2019 benchmark set is presented. We present the probabilistic model checker Storm. Storm supports the analysis of discrete- and continuous-time variants of both Markov chains and Markov decision processes. Storm has three major distinguishing features. It supports multiple input languages for Markov models, including the Jani and Prism modeling languages, dynamic fault trees, generalized stochastic Petri nets, and the probabilistic guarded command language. It has a modular setup in which solvers and symbolic engines can easily be exchanged. Its Python API allows for rapid prototyping by encapsulating Storm’s fast and scalable algorithms. This paper reports on the main features of Storm and explains how to effectively use them. A description is provided of the main distinguishing functionalities of Storm. Finally, an empirical evaluation of different configurations of Storm on the QComp 2019 benchmark set is presented.
Author	Junges, Sebastian Volk, Matthias Hensel, Christian Quatmann, Tim Katoen, Joost-Pieter
Author_xml	– sequence: 1 givenname: Christian surname: Hensel fullname: Hensel, Christian organization: RWTH Aachen University – sequence: 2 givenname: Sebastian surname: Junges fullname: Junges, Sebastian organization: University of California – sequence: 3 givenname: Joost-Pieter surname: Katoen fullname: Katoen, Joost-Pieter email: katoen@cs.rwth-aachen.de organization: RWTH Aachen University – sequence: 4 givenname: Tim surname: Quatmann fullname: Quatmann, Tim organization: RWTH Aachen University – sequence: 5 givenname: Matthias surname: Volk fullname: Volk, Matthias organization: RWTH Aachen University
BookMark	eNp9kE1LAzEQhoNUsK3-AU8L4nE1H2uyOUrxCwoerOeQzk5t6nZTk_Rgf72pKwoeCsPMe3ifmeEdkUHnOyTknNErRqm6jrlTXVLOSkqlEOXuiAxZlQVXtRr8aqVPyCjGFaVMSaWH5HK2xGIT_NzOXeticlCsfYNtAUuEdwzFS_JhfUqOF7aNePYzx-T1_m42eSynzw9Pk9tpCUKKVEIDc4u0Uoi1aIQGUUsJIPNybStkwlqwldYNMGmpYgtqUd2ABc0ZKs7FmFz0e_NHH1uMyaz8NnT5pOFSK5ZL7F1174LgYwy4MOCSTc53KVjXGkbNPhTTh2JyKOY7FLPLKP-HboJb2_B5GBI9FLO5e8Pw99UB6gv-GHae
CitedBy_id	crossref_primary_10_1016_j_jlamp_2025_101048 crossref_primary_10_1007_s10009_021_00633_z crossref_primary_10_1016_j_artint_2023_103856 crossref_primary_10_1145_3689731 crossref_primary_10_1145_3665927 crossref_primary_10_1016_j_trc_2024_104704 crossref_primary_10_1109_TAC_2022_3209612 crossref_primary_10_1145_3746234 crossref_primary_10_3390_app11115149 crossref_primary_10_1177_01445987251377791 crossref_primary_10_3390_axioms13120832 crossref_primary_10_1007_s10009_022_00652_4 crossref_primary_10_1016_j_jrtpm_2025_100523 crossref_primary_10_1016_j_scico_2025_103386 crossref_primary_10_1007_s10270_025_01281_6 crossref_primary_10_3390_s22239461 crossref_primary_10_1007_s10270_024_01226_5 crossref_primary_10_1145_3747534 crossref_primary_10_3390_app112412087 crossref_primary_10_1109_TSE_2025_3567423 crossref_primary_10_1145_3721142 crossref_primary_10_1016_j_peva_2025_102482 crossref_primary_10_1145_3696431 crossref_primary_10_3390_su141710822 crossref_primary_10_1016_j_jrtpm_2025_100539 crossref_primary_10_1016_j_scico_2024_103095 crossref_primary_10_1145_3624483 crossref_primary_10_1007_s10009_025_00810_4 crossref_primary_10_1145_3563344 crossref_primary_10_1109_TSE_2024_3385378
Cites_doi	10.1007/3-540-58085-9_75 10.1145/1838552.1838553 10.1007/978-3-319-11936-6_11 10.1007/978-3-642-36742-7_7 10.1145/190.191 10.1145/1965724.1965743 10.1007/978-3-642-35873-9_5 10.1145/343369.343402 10.1016/0022-247X(65)90154-X 10.1145/2560217.2560218 10.1016/S0020-0190(02)00455-6 10.1109/SFCS.1985.12 10.1007/978-3-319-10575-8_28 10.1007/3-540-46419-0_24 10.1007/978-3-030-83723-5_15 10.1007/978-3-030-30942-8_8 10.1109/DSN.2007.37 10.1145/3156018 10.1093/comjnl/bxq024 10.1007/3-540-48778-6_6 10.1007/3-540-44585-4_17 10.1007/s00165-012-0227-6 10.2168/LMCS-11(2:16)2015 10.1007/978-3-642-54862-8_51 10.1007/s10009-021-00633-z 10.1007/978-3-030-45190-5_19 10.1016/S0004-3702(98)00023-X 10.1007/978-3-662-54580-5_16 10.1016/j.peva.2010.04.001 10.1007/s10009-016-0433-2 10.1007/978-3-662-54580-5_11 10.1007/3-540-46002-0_5 10.1007/s10458-009-9103-z 10.1007/978-3-030-31784-3_28 10.1007/978-3-540-78800-3_24 10.1007/978-3-319-47166-2_1 10.1007/978-3-030-17502-3_5 10.1007/s10009-010-0146-x 10.1007/11880646_3 10.1287/opre.39.1.162 10.1007/978-3-642-33386-6_25 10.1609/aaai.v30i1.10422 10.1007/978-3-540-75596-8_31 10.1007/978-3-319-63387-9_10 10.1007/s11241-017-9269-4 10.1007/978-3-642-38697-8_6 10.1007/s10009-017-0456-3 10.1007/978-3-319-21690-4_13 10.1002/9780470316887 10.1007/978-3-319-24953-7_10 10.1007/978-3-030-17462-0_20 10.1007/3-540-63165-8_199 10.1007/978-3-642-15155-2_24 10.1145/2728816.2728827 10.1007/BF01211866 10.1007/978-3-319-63390-9_31 10.1007/978-3-030-59152-6_16 10.1109/CDC.2017.8263971 10.23919/FMCAD.2017.8102246 10.1145/2933575.2934574 10.1007/978-3-319-07317-0_3 10.1007/978-3-642-40196-1_4 10.1007/978-3-319-24318-4_26 10.1007/978-3-030-81688-9_28 10.1007/978-3-319-63387-9_7 10.1007/978-3-030-53291-8_26 10.1007/978-3-319-11439-2_10 10.1007/978-3-319-06410-9_22 10.1016/j.ress.2019.02.005 10.1109/TSE.2009.5 10.1007/978-3-319-11936-6_8 10.1109/SFCS.1988.21950 10.1007/978-3-319-96145-3_37 10.1109/DDECS.2008.4538787 10.1016/S0004-3702(02)00378-8 10.1007/978-3-540-31862-0_21 10.1007/s10817-020-09574-9 10.1016/j.cosrev.2015.03.001 10.1007/978-3-662-49674-9_8 10.1007/978-3-319-63387-9_8 10.1109/LICS.2010.41 10.1109/TSE.2003.1205180 10.1007/978-3-662-54580-5_9 10.1007/978-3-540-71209-1_9 10.24963/ijcai.2018/662 10.1145/3158668 10.1007/978-3-540-40903-8_8 10.1007/978-3-030-30281-8_4 10.1007/978-3-642-54862-8_43 10.1109/TII.2017.2710316 10.1145/2593882.2593900 10.1007/s00165-006-0015-2 10.1007/978-3-642-22110-1_47 10.1007/s10009-017-0468-z 10.1007/978-3-319-89963-3_19 10.1007/978-3-642-19835-9_11
ContentType	Journal Article
Copyright	The Author(s) 2021 The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: The Author(s) 2021 – notice: The Author(s) 2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	C6C AAYXX CITATION 3V. 7SC 7XB 8AL 8AO 8FD 8FE 8FG 8FK 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ GUQSH HCIFZ JQ2 K7- L6V L7M L~C L~D M0N M2O M7S MBDVC P5Z P62 PADUT PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U
DOI	10.1007/s10009-021-00633-z
DatabaseName	Springer Nature OA Free Journals CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Research Library Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology collection ProQuest One Community College ProQuest Central ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database ProQuest Research Library (NC LIVE) Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Research Library China ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic
DatabaseTitle	CrossRef Research Library Prep Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College Research Library (Alumni Edition) ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Research Library Research Library China ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection ProQuest Computing Engineering Database ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni)
DatabaseTitleList	CrossRef Research Library Prep
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1433-2787
EndPage	610
ExternalDocumentID	10_1007_s10009_021_00633_z
GrantInformation_xml	– fundername: RWTH Aachen University (3131)
GroupedDBID	-59 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 29J 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 8AO 8FE 8FG 8FW 8G5 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. BA0 BDATZ BENPR BGLVJ BGNMA BPHCQ BSONS C6C CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K6V K7- KDC KOV L6V LAS LLZTM M0N M2O M4Y M7S MA- MK~ ML~ N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM P62 P9O PADUT PF0 PQQKQ PROAC PT4 PT5 PTHSS Q2X QOS R89 R9I RIG RNI ROL RPX RSV RZK S16 S1Z S27 S3B SAP SCO SDH SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z7Z Z83 Z88 ZMTXR AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D MBDVC PKEHL PQEST PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c363t-cdcbae047ee83d39c3866cc6bab9a4e13aaca499dc16a071f0ae75cac921e7223
IEDL.DBID	K7-
ISICitedReferencesCount	135
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000670169200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1433-2779
IngestDate	Wed Nov 05 01:05:39 EST 2025 Tue Nov 18 21:32:49 EST 2025 Sat Nov 29 03:07:49 EST 2025 Fri Feb 21 02:45:07 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	Markov chain Model checking Markov decision process Verification Probilistic systems
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c363t-cdcbae047ee83d39c3866cc6bab9a4e13aaca499dc16a071f0ae75cac921e7223
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
OpenAccessLink	https://link.springer.com/10.1007/s10009-021-00633-z
PQID	2697197132
PQPubID	46652
PageCount	22
ParticipantIDs	proquest_journals_2697197132 crossref_citationtrail_10_1007_s10009_021_00633_z crossref_primary_10_1007_s10009_021_00633_z springer_journals_10_1007_s10009_021_00633_z
PublicationCentury	2000
PublicationDate	20220800 2022-08-00 20220801
PublicationDateYYYYMMDD	2022-08-01
PublicationDate_xml	– month: 8 year: 2022 text: 20220800
PublicationDecade	2020
PublicationPlace	Berlin/Heidelberg
PublicationPlace_xml	– name: Berlin/Heidelberg – name: Heidelberg
PublicationTitle	International journal on software tools for technology transfer
PublicationTitleAbbrev	Int J Softw Tools Technol Transfer
PublicationYear	2022
Publisher	Springer Berlin Heidelberg Springer Nature B.V
Publisher_xml	– name: Springer Berlin Heidelberg – name: Springer Nature B.V
References	MadaniOHanksSCondonAOn the undecidability of probabilistic planning and related stochastic optimization problemsArtif. Intell.20031471–2534199311310.1016/S0004-3702(02)00378-8 Courcoubetis, C., Yannakakis, M.: Verifying temporal properties of finite-state probabilistic programs. In: FOCS, pp. 338–345. IEEE Computer Society (1988) Hansson, H., Jonsson, B.: A framework for reasoning about time and reliability. In: RTSS, pp. 102–111. IEEE Computer Society (1989) Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard: Version 2.5. Tech. rep., Dep. of Computer Science, The University of Iowa (2015). www.smt-lib.org NormanGParkerDZouXVerification and control of partially observable probabilistic systemsReal-Time Syst.201753335440210.1007/s11241-017-9269-4 GhadhabMJungesSKatoenJPKuntzMVolkMSafety analysis for vehicle guidance systems with dynamic fault treesRel. Eng. Syst. Saf.2019186375010.1016/j.ress.2019.02.005 Baier, C., Klein, J., Klüppelholz, S., Märcker, S.: Computing conditional probabilities in Markovian models efficiently. In: TACAS, LNCS, vol. 8413, pp. 515–530. Springer (2014) Sullivan, K.J., Dugan, J.B., Coppit, D.: The galileo fault tree analysis tool. In: FTCS, pp. 232–235. IEEE Computer Society (1999) van Dijk, T.: Sylvan: multi-core decision diagrams. Ph.D. thesis, University of Twente, Enschede, Netherlands (2016) Daws, C.: Symbolic and parametric model checking of discrete-time Markov chains. In: ICTAC, LNCS, vol. 3407, pp. 280–294. Springer (2004) Baier, C., Klein, J., Klüppelholz, S., Wunderlich, S.: Maximizing the conditional expected reward for reaching the goal. In: TACAS (2), LNCS, vol. 10206, pp. 269–285 (2017) Eisentraut, C., Hermanns, H., Katoen, J.P., Zhang, L.: A semantics for every GSPN. In: Petri Nets, LNCS, vol. 7927, pp. 90–109. Springer (2013) Junges, S., Jansen, N., Dehnert, C., Topcu, U., Katoen, J.P.: Safety-constrained reinforcement learning for mdps. In: TACAS, LNCS, vol. 9636, pp. 130–146. Springer (2016) AlurRHenzingerTAVardiMYTheory in practice for system design and verificationSIGLOG News201521465110.1145/2728816.2728827 Quatmann, T., Katoen, J.P.: Sound value iteration. In: CAV (1), LNCS, vol. 10981, pp. 643–661. Springer (2018) KleinJBaierCChrszonPDaumMDubslaffCKlüppelholzSMärckerSMüllerDAdvances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic büchi automataSTTT201820217919410.1007/s10009-017-0456-3 Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM 4.0: Verification of probabilistic real-time systems. In: CAV, LNCS, vol. 6806, pp. 585–591. Springer (2011) Spel, J., Junges, S., Katoen, J.P.: Are parametric Markov chains monotonic? In: ATVA, LNCS, vol. 11781, pp. 479–496. Springer (2019) van DijkTvan de PolJMulti-core symbolic bisimulation minimisationSTTT201820215717710.1007/s10009-017-0468-z Katoen, J.P.: The probabilistic model checking landscape. In: LICS, pp. 31–45. ACM (2016) KatoenJPZapreevISHahnEMHermannsHJansenDNThe ins and outs of the probabilistic model checker MRMCPerform. Eval.20116829010410.1016/j.peva.2010.04.001 Helmink, L., Sellink, M.P.A., Vaandrager, F.W.: Proof-checking a data link protocol. In: TYPES, LNCS, vol. 806, pp. 127–165. Springer (1993) Budde, C.E., Hartmanns, A., Klauck, M., Kretínský, J., Parker, D., Quatmann, T., Turini, A., Zhang, Z.: On correctness, precision, and performance in quantitative verification (QComp 2020 competition report). In: ISoLA, LNCS. Springer (2020). (To Appear) KaelblingLPLittmanMLCassandraARPlanning and acting in partially observable stochastic domainsArtif. Intell.19981011–299134164153010.1016/S0004-3702(98)00023-X Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretínský, J., Kwiatkowska, M.Z., Parker, D., Ujma, M.: Verification of Markov decision processes using learning algorithms. In: ATVA, LNCS, vol. 8837, pp. 98–114. Springer (2014) Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The mathsat5 SMT solver. In: TACAS, LNCS, vol. 7795, pp. 93–107. Springer (2013) OlmedoFGretzFJansenNKaminskiBLKatoenJPMcIverAConditioning in probabilistic programmingACM Trans. Program. Lang. Syst.20184014:14:5010.1145/3156018 Baier, C., Clarke, E.M., Hartonas-Garmhausen, V., Kwiatkowska, M.Z., Ryan, M.: Symbolic model checking for probabilistic processes. In: ICALP, LNCS, vol. 1256, pp. 430–440. Springer (1997) QuatmannTDehnertCJansenNJungesSKatoenJPParameter synthesis for Markov models: faster than everATVA LNCS2016993850671398.68346 Hartmanns, A., Klauck, M., Parker, D., Quatmann, T., Ruijters, E.: The quantitative verification benchmark set. In: TACAS (1), LNCS, vol. 11427, pp. 344–350. Springer (2019) VolkMJungesSKatoenJPFast dynamic fault tree analysis by model checking techniquesIEEE Trans. Ind. Inform.201814137037910.1109/TII.2017.2710316 Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: LICS, pp. 342–351. IEEE Computer Society (2010) HahnEMHermannsHZhangLProbabilistic reachability for parametric Markov modelsSTTT201113131910.1007/s10009-010-0146-x Fredlund, L.: The timing and probability workbench: a tool for analysing timed processes. Tech. Rep. 49, Uppsala University (1994) Dehnert, C., Katoen, J.P., Parker, D.: SMT-based bisimulation minimisation of Markov models. In: VMCAI, LNCS, vol. 7737, pp. 28–47. Springer (2013) Bork, A., Junges, S., Katoen, J., Quatmann, T.: Verification of indefinite-horizon POMDPs. CoRR abs/2007.00102 (2020) DrägerKForejtVKwiatkowskaMZParkerDUjmaMPermissive controller synthesis for probabilistic systemsLogical Methods Comput. Sci.2015112336896210.2168/LMCS-11(2:16)2015 Guennebaud, G., Jacob, B., et al.: Eigen v3. http://eigen.tuxfamily.org (2010) Somenzi, F.: CUDD 3.0.0. http://vlsi.colorado.edu/~fabio/CUDD/html/. Also available at https://github.com/ivmai/cudd Chatterjee, K., Chmelik, M., Davies, J.: A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. In: AAAI, pp. 3225–3232. AAAI Press (2016) Butkova, Y., Hartmanns, A., Hermanns, H.: A Modest approach to modelling and checking Markov automata. In: QEST, LNCS, vol. 11785, pp. 52–69. Springer (2019) Dugan, J.B., Bavuso, S.J., Boyd, M.: Fault trees and sequence dependencies. In: Proceedings of RAMS, pp. 286–293. IEEE (1990). 10.1109/ARMS.1990.67971 Hartmanns, A., Kaminski, B.L.: Optimistic value iteration. In: CAV (2), LNCS, vol. 12225, pp. 488–511. Springer (2020) MarsanMAConteGBalboGA class of generalized stochastic petri nets for the performance evaluation of multiprocessor systemsACM Trans. Comput. Syst.1984229312210.1145/190.191 Horák, K., Bosanský, B., Chatterjee, K.: Goal-HSVI: heuristic search value iteration for goal POMDPs. In: IJCAI, pp. 4764–4770. ijcai.org (2018) Larsen, K.G., Legay, A.: Statistical model checking: past, present, and future. In: ISoLA (1), LNCS, vol. 9952, pp. 3–15 (2016) Baier, C., Klein, J., Leuschner, L., Parker, D., Wunderlich, S.: Ensuring the reliability of your model checker: interval iteration for Markov decision processes. In: CAV (1), LNCS, vol. 10426, pp. 160–180. Springer (2017) AzizASanwalKSinghalVBraytonRKModel-checking continous-time Markov chainsACM Trans. Comput. Log.200011162170185882610.1145/343369.343402 HahnEMHartmannsAA comparison of time- and reward-bounded probabilistic model checking techniquesSETTA LNCS20169984851001393.68104 Hensel, C.: The probabilistic model checker Storm: symbolic methods for probabilistic model checking. Ph.D. thesis, RWTH Aachen University, Germany (2018) Winterer, L., Junges, S., Wimmer, R., Jansen, N., Topcu, U., Katoen, J.P., Becker, B.: Motion planning under partial observability using game-based abstraction. In: CDC, pp. 2201–2208. IEEE (2017) Hahn, E.M., Hartmanns, A., Hensel, C., Klauck, M., Klein, J., Kretínský, J., Parker, D., Quatmann, T., Ruijters, E., Steinmetz, M.: The 2019 comparison of tools for the analysis of quantitative formal models- (QComp 2019 competition report). In: TACAS (3), LNCS, vol. 11429, pp. 69–92. Springer (2019) Pajarinen, J., Peltonen, J.: Periodic finite state controllers for efficient POMDP and DEC-POMDP planning. In: NIPS, pp. 2636–2644 (2011) Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: FOSE, pp. 167–181. ACM (2014) Kwiatkowska, M.Z., Norman, G., Segala, R.: Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM. In: CAV, LNCS, vol. 2102, pp. 194–206. Springer (2001) BaierCHaverkortBRHermannsHKatoenJModel-checking algorithms for continuous-time Markov chainsIEEE Trans. Softw. Eng.200329652454110.1109/TSE.2003.1205180 Braziunas, D., Boutilier, C.: Stochastic local search for POMDP controllers. In: AAAI, pp. 690–696. The MIT Press (2004) Delgrange, F., Katoen, J., Quatmann, T., Randour, M.: Simple strategies in multi-objective MDPs. In: TACAS (1), LNCS, vol. 12078, pp. 346–364. Springer (2020) Hartmanns, A., Hermanns, H.: The Modest Toolset: An integrated environment for quantitative modelling and verification. In: TACAS, LNCS, vol. 8413, pp. 593–598. Springer (2014) HolzmannGJMars codeCommun. ACM2014572647310.1145/2560217.2560218 ÅströmKOptimal control of Markov processes with incomplete state informationJ. Math. Anal. Appl.196510117420517357010.1016/0022-247X(65)90154-X Gurobi Optimization, L.: Gurobi optimizer reference manual (2019). http://www.gurobi.com Hansen, E.A.: Solving POMDPs by searching in policy space. In: UAI, pp. 211–219. Morgan Kaufmann (1998) Ashok, P., Chatterjee, K., Daca, P., Kretínský, J., Meggendorfer, T.: Value iteration for long-run average reward in Markov decision processes. In: CAV (1), LNCS, vol. 10426, pp. 201–221. Springer (2017) Dehnert, C., Jansen, N., Wimmer, R., Ábrahám, E., Katoen, J.P.: Fast debugging of PRISM models. In: ATVA, LNCS, vol. 8837, pp. 146–162. Springer (2014) Hensel, C., Junges, S., Katoen, J.P., Quatmann, T., Volk, M.: The probabilistic model checker storm: evaluation results and replication package (2020). https://doi.org/10.5281/zenodo.3571209 Hartmanns, A., Hermanns, H.: Explicit model checking of very larg K Åström (633_CR7) 1965; 10 633_CR48 633_CR49 JP Katoen (633_CR88) 2011; 68 633_CR47 633_CR44 633_CR45 633_CR42 633_CR43 M Volk (633_CR117) 2018; 14 633_CR40 633_CR41 G Norman (633_CR102) 2017; 53 C Amato (633_CR4) 2010; 21 M Ghadhab (633_CR54) 2019; 186 633_CR39 633_CR37 633_CR38 633_CR35 633_CR36 633_CR33 633_CR34 K Etessami (633_CR50) 2008; 4 633_CR32 633_CR30 S Kwek (633_CR90) 2003; 86 A Aziz (633_CR8) 2000; 1 T Quatmann (633_CR108) 2016; 9938 F Pedregosa (633_CR106) 2011; 12 T Ball (633_CR16) 2011; 54 O Madani (633_CR99) 2003; 147 633_CR68 633_CR69 633_CR67 633_CR64 633_CR65 633_CR62 633_CR60 M Bozzano (633_CR22) 2011; 54 H Hansson (633_CR66) 1994; 6 C Baier (633_CR11) 2003; 29 R Lanotte (633_CR96) 2007; 19 JR Norris (633_CR103) 1998 633_CR57 633_CR58 633_CR55 633_CR56 633_CR53 633_CR51 633_CR1 633_CR52 633_CR6 633_CR5 EM Hahn (633_CR59) 2016; 9984 E Ruijters (633_CR111) 2015; 15 633_CR86 633_CR87 633_CR84 633_CR82 633_CR83 633_CR80 EM Hahn (633_CR61) 2011; 13 633_CR81 633_CR9 M Calder (633_CR29) 2006; 4220 J Klein (633_CR89) 2018; 20 633_CR101 633_CR105 633_CR77 633_CR78 R Segala (633_CR112) 1995; 2 633_CR75 R Alur (633_CR3) 2015; 2 633_CR76 633_CR73 T Han (633_CR63) 2009; 35 633_CR71 633_CR72 633_CR70 LP Kaelbling (633_CR85) 1998; 101 C Baier (633_CR12) 2008 633_CR28 633_CR113 633_CR26 633_CR27 633_CR110 633_CR24 K Dräger (633_CR46) 2015; 11 633_CR25 633_CR116 633_CR115 633_CR23 633_CR114 633_CR20 633_CR21 MA Marsan (633_CR100) 1984; 2 F Olmedo (633_CR104) 2018; 40 G Agha (633_CR2) 2018; 28 633_CR109 633_CR19 633_CR17 WS Lovejoy (633_CR98) 1991; 39 633_CR124 633_CR18 633_CR123 633_CR15 633_CR122 633_CR121 633_CR13 633_CR14 633_CR125 MZ Kwiatkowska (633_CR94) 2012; 24 633_CR97 633_CR10 633_CR95 T van Dijk (633_CR119) 2018; 20 R Chadha (633_CR31) 2010; 12 633_CR93 633_CR120 633_CR91 633_CR92 GJ Holzmann (633_CR79) 2014; 57 ML Puterman (633_CR107) 1994 633_CR118 J He (633_CR74) 1997; 28
References_xml	– reference: Helmink, L., Sellink, M.P.A., Vaandrager, F.W.: Proof-checking a data link protocol. In: TYPES, LNCS, vol. 806, pp. 127–165. Springer (1993) – reference: KatoenJPZapreevISHahnEMHermannsHJansenDNThe ins and outs of the probabilistic model checker MRMCPerform. Eval.20116829010410.1016/j.peva.2010.04.001 – reference: RuijtersEStoelingaMFault tree analysis: a survey of the state-of-the-art in modeling, analysis and toolsComput. Sci. Rev.2015152962345478510.1016/j.cosrev.2015.03.001 – reference: Wimmer, R., Jansen, N., Vorpahl, A., Ábrahám, E., Katoen, J.P., Becker, B.: High-level counterexamples for probabilistic automata. In: QEST, LNCS, vol. 8054, pp. 39–54. Springer (2013) – reference: Eisentraut, C., Hermanns, H., Katoen, J.P., Zhang, L.: A semantics for every GSPN. In: Petri Nets, LNCS, vol. 7927, pp. 90–109. Springer (2013) – reference: Junges, S., Jansen, N., Wimmer, R., Quatmann, T., Winterer, L., Katoen, J.P., Becker, B.: Finite-state controllers of POMDPs using parameter synthesis. In: UAI, pp. 519–529. AUAI Press (2018) – reference: Katoen, J.P.: The probabilistic model checking landscape. In: LICS, pp. 31–45. ACM (2016) – reference: Quatmann, T., Katoen, J.P.: Sound value iteration. In: CAV (1), LNCS, vol. 10981, pp. 643–661. Springer (2018) – reference: Junges, S., Jansen, N., Seshia, S.A.: Enforcing almost-sure reachability in pomdps. CoRR abs/2007.00085 (2020) – reference: Haddad, S., Monmege, B.: Reachability in MDPs: refining convergence of value iteration. In: RP, LNCS, vol. 8762, pp. 125–137. Springer (2014) – reference: HahnEMHermannsHZhangLProbabilistic reachability for parametric Markov modelsSTTT201113131910.1007/s10009-010-0146-x – reference: NorrisJRMarkov Chains1998CambridgeCambridge University Press0938.60058 – reference: de Moura, L.M., Bjørner, N.: Z3: an efficient SMT solver. In: TACAS, LNCS, vol. 4963, pp. 337–340. Springer (2008) – reference: Ashok, P., Chatterjee, K., Daca, P., Kretínský, J., Meggendorfer, T.: Value iteration for long-run average reward in Markov decision processes. In: CAV (1), LNCS, vol. 10426, pp. 201–221. Springer (2017) – reference: Boudali, H., Crouzen, P., Stoelinga, M.: A compositional semantics for dynamic fault trees in terms of interactive Markov chains. In: ATVA, LNCS, vol. 4762, pp. 441–456. Springer (2007) – reference: BallTLevinVRajamaniSKA decade of software model checking with SLAMCommun. ACM2011547687610.1145/1965724.1965743 – reference: VolkMJungesSKatoenJPFast dynamic fault tree analysis by model checking techniquesIEEE Trans. Ind. Inform.201814137037910.1109/TII.2017.2710316 – reference: Horák, K., Bosanský, B., Chatterjee, K.: Goal-HSVI: heuristic search value iteration for goal POMDPs. In: IJCAI, pp. 4764–4770. ijcai.org (2018) – reference: Hensel, C., Junges, S., Katoen, J.P., Quatmann, T., Volk, M.: The probabilistic model checker storm: evaluation results and replication package (2020). https://doi.org/10.5281/zenodo.3571209 – reference: Baier, C., Klein, J., Klüppelholz, S., Märcker, S.: Computing conditional probabilities in Markovian models efficiently. In: TACAS, LNCS, vol. 8413, pp. 515–530. Springer (2014) – reference: PutermanMLMarkov Decision Processes1994New YorkWiley10.1002/9780470316887 – reference: Bork, A., Junges, S., Katoen, J., Quatmann, T.: Verification of indefinite-horizon POMDPs. CoRR abs/2007.00102 (2020) – reference: Courcoubetis, C., Yannakakis, M.: Verifying temporal properties of finite-state probabilistic programs. In: FOCS, pp. 338–345. IEEE Computer Society (1988) – reference: Winterer, L., Junges, S., Wimmer, R., Jansen, N., Topcu, U., Katoen, J.P., Becker, B.: Motion planning under partial observability using game-based abstraction. In: CDC, pp. 2201–2208. IEEE (2017) – reference: AghaGPalmskogKA survey of statistical model checkingACM Trans. Model. Comput. Simul.20182816:16:39375884010.1145/3158668 – reference: Gurobi Optimization, L.: Gurobi optimizer reference manual (2019). http://www.gurobi.com – reference: Dehnert, C., Jansen, N., Wimmer, R., Ábrahám, E., Katoen, J.P.: Fast debugging of PRISM models. In: ATVA, LNCS, vol. 8837, pp. 146–162. Springer (2014) – reference: LanotteRMaggiolo-SchettiniATroinaAParametric probabilistic transition systems for system design and analysisFormal Asp. Comput.20071919310910.1007/s00165-006-0015-2 – reference: ChadhaRViswanathanMA counterexample-guided abstraction-refinement framework for Markov decision processesACM Trans. Comput. Log.20101211:11:49273849310.1145/1838552.1838553 – reference: Baier, C., Klein, J., Leuschner, L., Parker, D., Wunderlich, S.: Ensuring the reliability of your model checker: interval iteration for Markov decision processes. In: CAV (1), LNCS, vol. 10426, pp. 160–180. Springer (2017) – reference: MarsanMAConteGBalboGA class of generalized stochastic petri nets for the performance evaluation of multiprocessor systemsACM Trans. Comput. Syst.1984229312210.1145/190.191 – reference: GhadhabMJungesSKatoenJPKuntzMVolkMSafety analysis for vehicle guidance systems with dynamic fault treesRel. Eng. Syst. Saf.2019186375010.1016/j.ress.2019.02.005 – reference: Baier, C., Clarke, E.M., Hartonas-Garmhausen, V., Kwiatkowska, M.Z., Ryan, M.: Symbolic model checking for probabilistic processes. In: ICALP, LNCS, vol. 1256, pp. 430–440. Springer (1997) – reference: AzizASanwalKSinghalVBraytonRKModel-checking continous-time Markov chainsACM Trans. Comput. Log.200011162170185882610.1145/343369.343402 – reference: BaierCKatoenJPPrinciples of Model Checking2008CambridgeMIT Press1179.68076 – reference: Chatterjee, K., Chmelik, M., Davies, J.: A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. In: AAAI, pp. 3225–3232. AAAI Press (2016) – reference: OlmedoFGretzFJansenNKaminskiBLKatoenJPMcIverAConditioning in probabilistic programmingACM Trans. Program. Lang. Syst.20184014:14:5010.1145/3156018 – reference: Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The mathsat5 SMT solver. In: TACAS, LNCS, vol. 7795, pp. 93–107. Springer (2013) – reference: Dehnert, C., Junges, S., Katoen, J.P., Volk, M.: A storm is coming: a modern probabilistic model checker. In: CAV (2), LNCS, vol. 10427, pp. 592–600. Springer (2017) – reference: Eisentraut, C., Hermanns, H., Zhang, L.: On probabilistic automata in continuous time. In: LICS, pp. 342–351. IEEE Computer Society (2010) – reference: Dugan, J.B., Bavuso, S.J., Boyd, M.: Fault trees and sequence dependencies. In: Proceedings of RAMS, pp. 286–293. IEEE (1990). 10.1109/ARMS.1990.67971 – reference: Hartmanns, A., Hermanns, H.: Explicit model checking of very large MDP using partitioning and secondary storage. In: ATVA, LNCS, vol. 9364, pp. 131–147. Springer (2015) – reference: BozzanoMCimattiAKatoenJPNguyenVYNollTRoveriMSafety, dependability and performance analysis of extended AADL modelsComput. J.201154575477510.1093/comjnl/bxq024 – reference: Ábrahám, E., Becker, B., Dehnert, C., Jansen, N., Katoen, J.P., Wimmer, R.: Counterexample generation for discrete-time Markov models: An introductory survey. In: SFM, LNCS, vol. 8483, pp. 65–121. Springer (2014) – reference: de Alfaro, L.: How to specify and verify the long-run average behavior of probabilistic systems. In: LICS, pp. 454–465. IEEE Computer Society (1998) – reference: Sullivan, K.J., Dugan, J.B., Coppit, D.: The galileo fault tree analysis tool. In: FTCS, pp. 232–235. IEEE Computer Society (1999) – reference: Wimmer, R.: Symbolische Methoden für die probabilistische Verifikation: Zustandsraumreduktion und Gegenbeispiele. In: Ausgezeichnete Informatikdissertationen, LNI, vol. D-12, pp. 271–280. GI (2011) – reference: DrägerKForejtVKwiatkowskaMZParkerDUjmaMPermissive controller synthesis for probabilistic systemsLogical Methods Comput. Sci.2015112336896210.2168/LMCS-11(2:16)2015 – reference: Daws, C.: Symbolic and parametric model checking of discrete-time Markov chains. In: ICTAC, LNCS, vol. 3407, pp. 280–294. Springer (2004) – reference: Braziunas, D., Boutilier, C.: Stochastic local search for POMDP controllers. In: AAAI, pp. 690–696. The MIT Press (2004) – reference: Junges, S., Ábrahám, E., Hensel, C., Jansen, N., Katoen, J.P., Quatmann, T., Volk, M.: Parameter synthesis for Markov models. CoRR abs/1903.07993 (2019) – reference: HeJSeidelKMcIverAProbabilistic models for the guarded command languageSci. Comput. Program.1997282–317119214665360877.68014 – reference: Budde, C.E., Dehnert, C., Hahn, E.M., Hartmanns, A., Junges, S., Turrini, A.: JANI: quantitative model and tool interaction. In: TACAS (2), LNCS, vol. 10206, pp. 151–168 (2017) – reference: Budde, C.E., Hartmanns, A., Klauck, M., Kretínský, J., Parker, D., Quatmann, T., Turini, A., Zhang, Z.: On correctness, precision, and performance in quantitative verification (QComp 2020 competition report). In: ISoLA, LNCS. Springer (2020). (To Appear) – reference: Forejt, V., Kwiatkowska, M.Z., Parker, D.: Pareto curves for probabilistic model checking. In: ATVA, LNCS, vol. 7561, pp. 317–332. Springer (2012) – reference: SegalaRLynchNAProbabilistic simulations for probabilistic processesNord. J. Comput.19952225027313460620839.68067 – reference: NormanGParkerDZouXVerification and control of partially observable probabilistic systemsReal-Time Syst.201753335440210.1007/s11241-017-9269-4 – reference: Pajarinen, J., Peltonen, J.: Periodic finite state controllers for efficient POMDP and DEC-POMDP planning. In: NIPS, pp. 2636–2644 (2011) – reference: Wachter, B.: Refined probabilistic abstraction. Ph.D. thesis, Saarland University (2011) – reference: BaierCHaverkortBRHermannsHKatoenJModel-checking algorithms for continuous-time Markov chainsIEEE Trans. Softw. Eng.200329652454110.1109/TSE.2003.1205180 – reference: Delgrange, F., Katoen, J., Quatmann, T., Randour, M.: Simple strategies in multi-objective MDPs. In: TACAS (1), LNCS, vol. 12078, pp. 346–364. Springer (2020) – reference: ÅströmKOptimal control of Markov processes with incomplete state informationJ. Math. Anal. Appl.196510117420517357010.1016/0022-247X(65)90154-X – reference: HanTKatoenJPDammanBCounterexample generation in probabilistic model checkingIEEE Trans. Softw. Eng.200935224125710.1109/TSE.2009.5 – reference: Dehnert, C., Junges, S., Jansen, N., Corzilius, F., Volk, M., Bruintjes, H., Katoen, J.P., Ábrahám, E.: Prophesy: a probabilistic parameter synthesis tool. In: CAV (1), LNCS, vol. 9206, pp. 214–231. Springer (2015) – reference: AmatoCBernsteinDSZilbersteinSOptimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPsAuton. Agent. Multi-Agent Syst.201021329332010.1007/s10458-009-9103-z – reference: Hartmanns, A., Hermanns, H.: The Modest Toolset: An integrated environment for quantitative modelling and verification. In: TACAS, LNCS, vol. 8413, pp. 593–598. Springer (2014) – reference: Larsen, K.G., Legay, A.: Statistical model checking: past, present, and future. In: ISoLA (1), LNCS, vol. 9952, pp. 3–15 (2016) – reference: Kwiatkowska, M.Z., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: QEST, pp. 157–166. IEEE Computer Society (2006) – reference: Gordon, A.D., Henzinger, T.A., Nori, A.V., Rajamani, S.K.: Probabilistic programming. In: FOSE, pp. 167–181. ACM (2014) – reference: Kwiatkowska, M.Z., Norman, G., Segala, R.: Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM. In: CAV, LNCS, vol. 2102, pp. 194–206. Springer (2001) – reference: Hartmanns, A., Kaminski, B.L.: Optimistic value iteration. In: CAV (2), LNCS, vol. 12225, pp. 488–511. Springer (2020) – reference: Baier, C., Klein, J., Klüppelholz, S., Wunderlich, S.: Maximizing the conditional expected reward for reaching the goal. In: TACAS (2), LNCS, vol. 10206, pp. 269–285 (2017) – reference: Hansen, E.A.: Solving POMDPs by searching in policy space. In: UAI, pp. 211–219. Morgan Kaufmann (1998) – reference: Hermanns, H., Katoen, J.P., Meyer-Kayser, J., Siegle, M.: A Markov chain model checker. In: TACAS, LNCS, vol. 1785, pp. 347–362. Springer (2000) – reference: Hensel, C.: The probabilistic model checker Storm: symbolic methods for probabilistic model checking. Ph.D. thesis, RWTH Aachen University, Germany (2018) – reference: MadaniOHanksSCondonAOn the undecidability of probabilistic planning and related stochastic optimization problemsArtif. Intell.20031471–2534199311310.1016/S0004-3702(02)00378-8 – reference: Hartonas-Garmhausen, V., Campos, S.V.A., Clarke, E.M.: ProbVerus: probabilistic symbolic model checking. In: ARTS, LNCS, vol. 1601, pp. 96–110. Springer (1999) – reference: AlurRHenzingerTAVardiMYTheory in practice for system design and verificationSIGLOG News201521465110.1145/2728816.2728827 – reference: Forejt, V., Kwiatkowska, M.Z., Norman, G., Parker, D., Qu, H.: Quantitative multi-objective verification for probabilistic systems. In: TACAS, LNCS, vol. 6605, pp. 112–127. Springer (2011) – reference: Hahn, E.M., Hartmanns, A., Hensel, C., Klauck, M., Klein, J., Kretínský, J., Parker, D., Quatmann, T., Ruijters, E., Steinmetz, M.: The 2019 comparison of tools for the analysis of quantitative formal models- (QComp 2019 competition report). In: TACAS (3), LNCS, vol. 11429, pp. 69–92. Springer (2019) – reference: Hartmanns, A., Junges, S., Katoen, J.P., Quatmann, T.: Multi-cost bounded reachability in MDP. In: TACAS (2), LNCS, vol. 10806, pp. 320–339. Springer (2018) – reference: Hansson, H., Jonsson, B.: A framework for reasoning about time and reliability. In: RTSS, pp. 102–111. IEEE Computer Society (1989) – reference: Quatmann, T., Junges, S., Katoen, J.P.: Markov automata with multiple objectives. In: CAV (1), LNCS, vol. 10426, pp. 140–159. Springer (2017) – reference: Hartmanns, A., Klauck, M., Parker, D., Quatmann, T., Ruijters, E.: The quantitative verification benchmark set. In: TACAS (1), LNCS, vol. 11427, pp. 344–350. Springer (2019) – reference: Kwiatkowska, M.Z., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: a hybrid approach. In: TACAS, LNCS, vol. 2280, pp. 52–66. Springer (2002) – reference: Wimmer, R., Kortus, A., Herbstritt, M., Becker, B.: Probabilistic model checking and reliability of results. In: DDECS, pp. 207–212. IEEE Computer Society (2008) – reference: Butkova, Y., Wimmer, R., Hermanns, H.: Long-run rewards for Markov automata. In: TACAS (2), LNCS, vol. 10206, pp. 188–203 (2017) – reference: Andova, S., Hermanns, H., Katoen, J.P.: Discrete-time rewards model-checked. In: FORMATS, LNCS, vol. 2791, pp. 88–104. Springer (2003) – reference: Hartmanns, A., Junges, S., Katoen, J.P., Quatmann, T.: Multi-cost bounded tradeoff analysis in MDP. JAR (2020) – reference: Baier, C., de Alfaro, L., Forejt, V., Kwiatkowska, M.: Model checking probabilistic systems. In: Handbook of Model Checking, pp. 963–999. Springer (2018) – reference: LovejoyWSComputationally feasible bounds for partially observed Markov decision processesOper. Res.1991391162175109619710.1287/opre.39.1.162 – reference: Hahn, E.M., Li, Y., Schewe, S., Turrini, A., Zhang, L.: iscasMc: A web-based probabilistic model checker. In: FM, LNCS, vol. 8442, pp. 312–317. Springer (2014) – reference: Bauer, M.S., Mathur, U., Chadha, R., Sistla, A.P., Viswanathan, M.: Exact quantitative probabilistic model checking through rational search. In: FMCAD, pp. 92–99. IEEE (2017) – reference: Katoen, J.P., Kemna, T., Zapreev, I.S., Jansen, D.N.: Bisimulation minimisation mostly speeds up probabilistic model checking. In: TACAS, LNCS, vol. 4424, pp. 87–101. Springer (2007) – reference: QuatmannTDehnertCJansenNJungesSKatoenJPParameter synthesis for Markov models: faster than everATVA LNCS2016993850671398.68346 – reference: Junges, S., Jansen, N., Dehnert, C., Topcu, U., Katoen, J.P.: Safety-constrained reinforcement learning for mdps. In: TACAS, LNCS, vol. 9636, pp. 130–146. Springer (2016) – reference: Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretínský, J., Kwiatkowska, M.Z., Parker, D., Ujma, M.: Verification of Markov decision processes using learning algorithms. In: ATVA, LNCS, vol. 8837, pp. 98–114. Springer (2014) – reference: van DijkTvan de PolJMulti-core symbolic bisimulation minimisationSTTT201820215717710.1007/s10009-017-0468-z – reference: KwiatkowskaMZNormanGParkerDProbabilistic verification of Herman’s self-stabilisation algorithmFormal Asp. Comput.2012244–6661670294727310.1007/s00165-012-0227-6 – reference: Ceska, M., Hensel, C., Junges, S., Katoen, J.P.: Counterexample-driven synthesis for probabilistic program sketches. In: FM, LNCS, vol. 11800, pp. 101–120. Springer (2019) – reference: Meuleau, N., Kim, K., Kaelbling, L.P., Cassandra, A.R.: Solving POMDPs by searching the space of finite policies. In: UAI, pp. 417–426. Morgan Kaufmann (1999) – reference: Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard: Version 2.5. Tech. rep., Dep. of Computer Science, The University of Iowa (2015). www.smt-lib.org – reference: Dehnert, C., Katoen, J.P., Parker, D.: SMT-based bisimulation minimisation of Markov models. In: VMCAI, LNCS, vol. 7737, pp. 28–47. Springer (2013) – reference: Spel, J., Junges, S., Katoen, J.P.: Are parametric Markov chains monotonic? In: ATVA, LNCS, vol. 11781, pp. 479–496. Springer (2019) – reference: Corzilius, F., Kremer, G., Junges, S., Schupp, S., Ábrahám, E.: SMT-RAT: an open source C++ toolbox for strategic and parallel SMT solving. In: SAT, LNCS, vol. 9340, pp. 360–368. Springer (2015) – reference: HolzmannGJMars codeCommun. ACM2014572647310.1145/2560217.2560218 – reference: Condon, A.: On algorithms for simple stochastic games. In: Advances in Computational Complexity Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 51–71. DIMACS/AMS (1990) – reference: KleinJBaierCChrszonPDaumMDubslaffCKlüppelholzSMärckerSMüllerDAdvances in probabilistic model checking with PRISM: variable reordering, quantiles and weak deterministic büchi automataSTTT201820217919410.1007/s10009-017-0456-3 – reference: Butkova, Y., Hartmanns, A., Hermanns, H.: A Modest approach to modelling and checking Markov automata. In: QEST, LNCS, vol. 11785, pp. 52–69. Springer (2019) – reference: Fredlund, L.: The timing and probability workbench: a tool for analysing timed processes. Tech. Rep. 49, Uppsala University (1994) – reference: Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM 4.0: Verification of probabilistic real-time systems. In: CAV, LNCS, vol. 6806, pp. 585–591. Springer (2011) – reference: Winkler, T., Junges, S., Pérez, G.A., Katoen, J.: On the complexity of reachability in parametric markov decision processes. In: CONCUR, LIPIcs, vol. 140, pp. 14:1–14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019) – reference: KaelblingLPLittmanMLCassandraARPlanning and acting in partially observable stochastic domainsArtif. Intell.19981011–299134164153010.1016/S0004-3702(98)00023-X – reference: HanssonHJonssonBA logic for reasoning about time and reliabilityFormal Asp. Comput.19946551253510.1007/BF01211866 – reference: Guennebaud, G., Jacob, B., et al.: Eigen v3. http://eigen.tuxfamily.org (2010) – reference: Boudali, H., Crouzen, P., Stoelinga, M.: Dynamic fault tree analysis using input/output interactive Markov chains. In: DSN, pp. 708–717. IEEE Computer Society (2007) – reference: Somenzi, F.: CUDD 3.0.0. http://vlsi.colorado.edu/~fabio/CUDD/html/. Also available at https://github.com/ivmai/cudd – reference: Chatterjee, K., Doyen, L., Henzinger, T.A.: Qualitative analysis of partially-observable Markov decision processes. In: MFCS, LNCS, vol. 6281, pp. 258–269. Springer (2010) – reference: PedregosaFVaroquauxGGramfortAMichelVThirionBGriselOBlondelMPrettenhoferPWeissRDubourgVVanderPlasJPassosACournapeauDBrucherMPerrotMDuchesnayEScikit-learn: machine learning in pythonJ. Mach. Learn. Res.2011122825283028543481280.68189 – reference: EtessamiKKwiatkowskaMZVardiMYYannakakisMMulti-objective model checking of Markov decision processesLogical Methods Comput. Sci.20084424568471161.68565 – reference: HahnEMHartmannsAA comparison of time- and reward-bounded probabilistic model checking techniquesSETTA LNCS20169984851001393.68104 – reference: KwekSMehlhornKOptimal search for rationalsInf. Process. Lett.20038612326195992310.1016/S0020-0190(02)00455-6 – reference: CalderMVyshemirskyVGilbertDROrtonRJAnalysis of signalling pathways using continuous time Markov chainsTrans. Comput. Syst. Biol. VI LNCS200642204467233079910.1007/11880646_3 – reference: Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: FOCS, pp. 327–338. IEEE Computer Society (1985) – reference: van Dijk, T.: Sylvan: multi-core decision diagrams. Ph.D. thesis, University of Twente, Enschede, Netherlands (2016) – ident: 633_CR75 doi: 10.1007/3-540-58085-9_75 – volume: 12 start-page: 1:1 issue: 1 year: 2010 ident: 633_CR31 publication-title: ACM Trans. Comput. Log. doi: 10.1145/1838552.1838553 – ident: 633_CR39 doi: 10.1007/978-3-319-11936-6_11 – ident: 633_CR34 doi: 10.1007/978-3-642-36742-7_7 – volume: 2 start-page: 93 issue: 2 year: 1984 ident: 633_CR100 publication-title: ACM Trans. Comput. Syst. doi: 10.1145/190.191 – volume: 54 start-page: 68 issue: 7 year: 2011 ident: 633_CR16 publication-title: Commun. ACM doi: 10.1145/1965724.1965743 – ident: 633_CR42 doi: 10.1007/978-3-642-35873-9_5 – volume: 9938 start-page: 50 year: 2016 ident: 633_CR108 publication-title: ATVA LNCS – ident: 633_CR113 – volume: 1 start-page: 162 issue: 1 year: 2000 ident: 633_CR8 publication-title: ACM Trans. Comput. Log. doi: 10.1145/343369.343402 – volume: 10 start-page: 174 issue: 1 year: 1965 ident: 633_CR7 publication-title: J. Math. Anal. Appl. doi: 10.1016/0022-247X(65)90154-X – volume: 57 start-page: 64 issue: 2 year: 2014 ident: 633_CR79 publication-title: Commun. ACM doi: 10.1145/2560217.2560218 – volume: 86 start-page: 23 issue: 1 year: 2003 ident: 633_CR90 publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(02)00455-6 – ident: 633_CR57 – ident: 633_CR116 doi: 10.1109/SFCS.1985.12 – ident: 633_CR9 doi: 10.1007/978-3-319-10575-8_28 – ident: 633_CR78 doi: 10.1007/3-540-46419-0_24 – ident: 633_CR124 – ident: 633_CR26 doi: 10.1007/978-3-030-83723-5_15 – ident: 633_CR30 doi: 10.1007/978-3-030-30942-8_8 – ident: 633_CR21 doi: 10.1109/DSN.2007.37 – volume: 40 start-page: 4:1 issue: 1 year: 2018 ident: 633_CR104 publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/3156018 – volume: 54 start-page: 754 issue: 5 year: 2011 ident: 633_CR22 publication-title: Comput. J. doi: 10.1093/comjnl/bxq024 – ident: 633_CR73 doi: 10.1007/3-540-48778-6_6 – ident: 633_CR95 doi: 10.1007/3-540-44585-4_17 – volume: 28 start-page: 171 issue: 2–3 year: 1997 ident: 633_CR74 publication-title: Sci. Comput. Program. – volume: 24 start-page: 661 issue: 4–6 year: 2012 ident: 633_CR94 publication-title: Formal Asp. Comput. doi: 10.1007/s00165-012-0227-6 – volume: 11 start-page: 2 year: 2015 ident: 633_CR46 publication-title: Logical Methods Comput. Sci. doi: 10.2168/LMCS-11(2:16)2015 – ident: 633_CR67 doi: 10.1007/978-3-642-54862-8_51 – ident: 633_CR77 doi: 10.1007/s10009-021-00633-z – ident: 633_CR43 doi: 10.1007/978-3-030-45190-5_19 – volume: 101 start-page: 99 issue: 1–2 year: 1998 ident: 633_CR85 publication-title: Artif. Intell. doi: 10.1016/S0004-3702(98)00023-X – ident: 633_CR14 doi: 10.1007/978-3-662-54580-5_16 – volume: 68 start-page: 90 issue: 2 year: 2011 ident: 633_CR88 publication-title: Perform. Eval. doi: 10.1016/j.peva.2010.04.001 – ident: 633_CR118 doi: 10.1007/s10009-016-0433-2 – volume: 12 start-page: 2825 year: 2011 ident: 633_CR106 publication-title: J. Mach. Learn. Res. – ident: 633_CR84 – ident: 633_CR28 doi: 10.1007/978-3-662-54580-5_11 – ident: 633_CR91 doi: 10.1007/3-540-46002-0_5 – volume: 21 start-page: 293 issue: 3 year: 2010 ident: 633_CR4 publication-title: Auton. Agent. Multi-Agent Syst. doi: 10.1007/s10458-009-9103-z – ident: 633_CR114 doi: 10.1007/978-3-030-31784-3_28 – ident: 633_CR45 doi: 10.1007/978-3-540-78800-3_24 – ident: 633_CR97 doi: 10.1007/978-3-319-47166-2_1 – ident: 633_CR60 doi: 10.1007/978-3-030-17502-3_5 – volume: 13 start-page: 3 issue: 1 year: 2011 ident: 633_CR61 publication-title: STTT doi: 10.1007/s10009-010-0146-x – volume: 4220 start-page: 44 year: 2006 ident: 633_CR29 publication-title: Trans. Comput. Syst. Biol. VI LNCS doi: 10.1007/11880646_3 – ident: 633_CR81 – volume: 39 start-page: 162 issue: 1 year: 1991 ident: 633_CR98 publication-title: Oper. Res. doi: 10.1287/opre.39.1.162 – ident: 633_CR105 – ident: 633_CR64 – ident: 633_CR52 doi: 10.1007/978-3-642-33386-6_25 – ident: 633_CR32 doi: 10.1609/aaai.v30i1.10422 – ident: 633_CR20 doi: 10.1007/978-3-540-75596-8_31 – ident: 633_CR6 doi: 10.1007/978-3-319-63387-9_10 – ident: 633_CR92 – volume: 53 start-page: 354 issue: 3 year: 2017 ident: 633_CR102 publication-title: Real-Time Syst. doi: 10.1007/s11241-017-9269-4 – ident: 633_CR48 doi: 10.1007/978-3-642-38697-8_6 – volume: 20 start-page: 179 issue: 2 year: 2018 ident: 633_CR89 publication-title: STTT doi: 10.1007/s10009-017-0456-3 – ident: 633_CR40 doi: 10.1007/978-3-319-21690-4_13 – volume-title: Markov Decision Processes year: 1994 ident: 633_CR107 doi: 10.1002/9780470316887 – ident: 633_CR68 doi: 10.1007/978-3-319-24953-7_10 – ident: 633_CR72 doi: 10.1007/978-3-030-17462-0_20 – ident: 633_CR44 – ident: 633_CR10 doi: 10.1007/3-540-63165-8_199 – ident: 633_CR33 doi: 10.1007/978-3-642-15155-2_24 – volume: 2 start-page: 46 issue: 1 year: 2015 ident: 633_CR3 publication-title: SIGLOG News doi: 10.1145/2728816.2728827 – volume: 6 start-page: 512 issue: 5 year: 1994 ident: 633_CR66 publication-title: Formal Asp. Comput. doi: 10.1007/BF01211866 – ident: 633_CR24 – ident: 633_CR41 doi: 10.1007/978-3-319-63390-9_31 – ident: 633_CR19 doi: 10.1007/978-3-030-59152-6_16 – ident: 633_CR125 doi: 10.1109/CDC.2017.8263971 – ident: 633_CR47 – ident: 633_CR18 doi: 10.23919/FMCAD.2017.8102246 – ident: 633_CR86 doi: 10.1145/2933575.2934574 – ident: 633_CR1 doi: 10.1007/978-3-319-07317-0_3 – ident: 633_CR53 – ident: 633_CR76 – ident: 633_CR122 doi: 10.1007/978-3-642-40196-1_4 – ident: 633_CR36 doi: 10.1007/978-3-319-24318-4_26 – ident: 633_CR83 doi: 10.1007/978-3-030-81688-9_28 – ident: 633_CR35 – ident: 633_CR109 doi: 10.1007/978-3-319-63387-9_7 – ident: 633_CR71 doi: 10.1007/978-3-030-53291-8_26 – volume-title: Principles of Model Checking year: 2008 ident: 633_CR12 – ident: 633_CR58 doi: 10.1007/978-3-319-11439-2_10 – ident: 633_CR62 doi: 10.1007/978-3-319-06410-9_22 – volume: 2 start-page: 250 issue: 2 year: 1995 ident: 633_CR112 publication-title: Nord. J. Comput. – ident: 633_CR120 – volume: 186 start-page: 37 year: 2019 ident: 633_CR54 publication-title: Rel. Eng. Syst. Saf. doi: 10.1016/j.ress.2019.02.005 – volume: 35 start-page: 241 issue: 2 year: 2009 ident: 633_CR63 publication-title: IEEE Trans. Softw. Eng. doi: 10.1109/TSE.2009.5 – ident: 633_CR23 doi: 10.1007/978-3-319-11936-6_8 – ident: 633_CR37 doi: 10.1109/SFCS.1988.21950 – ident: 633_CR110 doi: 10.1007/978-3-319-96145-3_37 – volume: 4 start-page: 4 year: 2008 ident: 633_CR50 publication-title: Logical Methods Comput. Sci. – ident: 633_CR56 – ident: 633_CR123 doi: 10.1109/DDECS.2008.4538787 – volume: 147 start-page: 5 issue: 1–2 year: 2003 ident: 633_CR99 publication-title: Artif. Intell. doi: 10.1016/S0004-3702(02)00378-8 – ident: 633_CR38 doi: 10.1007/978-3-540-31862-0_21 – ident: 633_CR70 doi: 10.1007/s10817-020-09574-9 – volume: 15 start-page: 29 year: 2015 ident: 633_CR111 publication-title: Comput. Sci. Rev. doi: 10.1016/j.cosrev.2015.03.001 – ident: 633_CR82 doi: 10.1007/978-3-662-49674-9_8 – ident: 633_CR15 doi: 10.1007/978-3-319-63387-9_8 – ident: 633_CR121 – ident: 633_CR49 doi: 10.1109/LICS.2010.41 – ident: 633_CR65 – volume: 29 start-page: 524 issue: 6 year: 2003 ident: 633_CR11 publication-title: IEEE Trans. Softw. Eng. doi: 10.1109/TSE.2003.1205180 – ident: 633_CR25 doi: 10.1007/978-3-662-54580-5_9 – ident: 633_CR115 – ident: 633_CR87 doi: 10.1007/978-3-540-71209-1_9 – ident: 633_CR80 doi: 10.24963/ijcai.2018/662 – ident: 633_CR17 – volume: 28 start-page: 6:1 issue: 1 year: 2018 ident: 633_CR2 publication-title: ACM Trans. Model. Comput. Simul. doi: 10.1145/3158668 – volume-title: Markov Chains year: 1998 ident: 633_CR103 – ident: 633_CR5 doi: 10.1007/978-3-540-40903-8_8 – ident: 633_CR27 doi: 10.1007/978-3-030-30281-8_4 – volume: 9984 start-page: 85 year: 2016 ident: 633_CR59 publication-title: SETTA LNCS – ident: 633_CR101 – ident: 633_CR13 doi: 10.1007/978-3-642-54862-8_43 – volume: 14 start-page: 370 issue: 1 year: 2018 ident: 633_CR117 publication-title: IEEE Trans. Ind. Inform. doi: 10.1109/TII.2017.2710316 – ident: 633_CR55 doi: 10.1145/2593882.2593900 – volume: 19 start-page: 93 issue: 1 year: 2007 ident: 633_CR96 publication-title: Formal Asp. Comput. doi: 10.1007/s00165-006-0015-2 – ident: 633_CR93 doi: 10.1007/978-3-642-22110-1_47 – volume: 20 start-page: 157 issue: 2 year: 2018 ident: 633_CR119 publication-title: STTT doi: 10.1007/s10009-017-0468-z – ident: 633_CR69 doi: 10.1007/978-3-319-89963-3_19 – ident: 633_CR51 doi: 10.1007/978-3-642-19835-9_11
SSID	ssj0017679
Score	2.6591449
Snippet	We present the probabilistic model checker Storm . Storm supports the analysis of discrete- and continuous-time variants of both Markov chains and Markov... We present the probabilistic model checker Storm. Storm supports the analysis of discrete- and continuous-time variants of both Markov chains and Markov...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	589
SubjectTerms	Algorithms Awards & honors Command languages Competitions and Challenges Computer Science Empirical analysis Fault trees Languages Markov analysis Markov chains Petri nets Probabilistic models Probability theory Rapid prototyping Software Engineering Software Engineering/Programming and Operating Systems Theory of Computation
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60evBifWK1Sg560oXso9nsUcTiqYhV6S1sJxsQtEobPfTXO7tNWhUVFHLL7hBm5_FNdh4Axyl3HG2BzJLhY-QhCmbzGBkvhIgJzaXW5WHYhO710sHAXFdFYZM6272-kgyW-kOxW_iRLyj8Jb8q2XQZVsjdpV4db_r387sDnYQOewQEJBNam6pU5nsan93RAmN-uRYN3qbb_N93bsB6hS6j85k4bMKSG21Bs57cEFWKvA0nJB2RnyUT-uv6Vs1RGIkT0RH6PIuoT6H40w7cdS9vL65YNTCBoUxkyTDHoXWx0s6lMpcGZZokiAkRM1Y5Lq1FSyFOjjyxhC2K2DrdQYtGcKcJKOxCY_Q8cnsQpRTYqCKWhOaGilClNarj4iGZRmWUivMW8JpvGVbdxP1Qi8ds0QfZ8yEjPmSBD9m0BafzPS-zXhq_rm7Xx5FVejXJRGI0p0eKFpzV7F-8_pna_t-WH8Ca8HUOIdOvDY1y_OoOYRXfyofJ-CjI2zsImM3S priority: 102 providerName: Springer Nature
Title	The probabilistic model checker Storm
URI	https://link.springer.com/article/10.1007/s10009-021-00633-z https://www.proquest.com/docview/2697197132
Volume	24
WOSCitedRecordID	wos000670169200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1433-2787 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0017679 issn: 1433-2779 databaseCode: P5Z dateStart: 20190101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1433-2787 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0017679 issn: 1433-2779 databaseCode: K7- dateStart: 20190101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1433-2787 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0017679 issn: 1433-2779 databaseCode: M7S dateStart: 20190101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1433-2787 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0017679 issn: 1433-2779 databaseCode: BENPR dateStart: 20190101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Research Library (NC LIVE) customDbUrl: eissn: 1433-2787 dateEnd: 20241207 omitProxy: false ssIdentifier: ssj0017679 issn: 1433-2779 databaseCode: M2O dateStart: 20190101 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVAVX databaseName: Springer LINK customDbUrl: eissn: 1433-2787 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017679 issn: 1433-2779 databaseCode: RSV dateStart: 19971201 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fS8MwED5088EX50-cztEHfdJgk3RN-yQqE0GcY1MZvpQsTUHQbW7Th_31XrJ0RcG9COVe2oZyud59l0vuAziOqKZKZopIdHwEI0RGZOorQjPGfERzkdSpJZsQrVbU68Vtt-A2cdsqc59oHXU6VGaN_JyFsaB4cXYx-iCGNcpUVx2FxiqUKWPU2PmdIIsqgghtrz2EBJwwIWJ3aMYdnbNlAYbJNEZpTmY_A1OBNn8VSG3cuan894s3YcMhTu9ybiJbsKIH21DJ2Rw893PvwAlajGf4ZWzPXdO-2bM0OR5Oq9l74XUxPX_fhaeb5uP1LXEkCkTxkE-JSlVfaj8QWkc85bHiURgqFeJgsQw05VIqiWlPqmgoEW9kvtSioaSKGdUCwcMelAbDgd4HL8JkJ8h8jgivHyDSlHHQ0H4f3WUQB4GfVoHmGkyU6zBuiC7ekqI3stF6glpPrNaTWRVOF--M5v01lj5dy1WduH9tkhR6rsJZPlnF7b9HO1g-2iGsM3PWwe72q0FpOv7UR7Cmvqavk3EdylfNVrtTtxaH8p49GCm6KNuNF5Sd7vM3HxrckQ
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5KFfRifWK1ag72pIvJ7jaPg4iopaW1CK3QW9xsNiBIW9uq2B_lb3R2m7Qo2FsPQm7JLiEzO_NN5vEBnPqOcqRIJBFo-Ah6iISI2JbESSi1Ec35QsWGbMJrtfxuN3jIwVfWC6PLKjObaAx13Jf6H_kFdQPPwYvRq8Er0axROruaUWhM1aKhPj8wZBtd1m9RvmVKq3edmxpJWQWIZC4bExnLSCibe0r5LGaBZL7rSulGIgoEVw4TQgqMA2LpuAIdcGIL5VWkkAF1lEf1oAM0-StcW39TKtieZS0818z2QwjCCPW8IG3SSVv1TBqCYvCOqICRyU9HOEe3vxKyxs9VC__tC23CRoqorevpEdiCnOptQyFjq7BS47UDZTwRlubPMTOF9Xhqy9AAWai2urbEao8Rv-_C41Jedg_yvX5P7YPlYzDHE5shgo04ImkR8IqyI3QHPODcjovgZBILZTpBXRN5vITz2c9ayiFKOTRSDidFOJutGUznhyx8upSJNkxtySicy7UI55lyzG__vdvB4t1OYK3WuW-GzXqrcQjrVPd1mMrGEuTHwzd1BKvyffw8Gh4bLbfgadlK8w30azem
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5KFfFifWK1ag72pEuT3TSbHETEWiyVUlCheImbzQYEaWtbFfvT_HXObpMGBb31IOSW7BIyszPfZB4fwLHvKEeKRBKBho-gh0iIiG1JnIRSG9GcL1RsyCZ4p-P3ekG3AJ9ZL4wuq8xsojHU8UDqf-Q16gXcwYvRWpKWRXQbzfPhC9EMUjrTmtFpzFSkrT7eMXwbn7UaKOsqpc2ru8trkjIMEMk8NiEylpFQtsuV8lnMAsl8z5PSi0QUCFc5TAgpMCaIpeMJdMaJLRSvSyED6ihO9dADNP9LHGNMHfh16w_zDAb3zJw_hCOMUM6DtGEnbdszKQmKgTwiBEam351ijnR_JGeNz2uW_vPXWoe1FGlbF7OjsQEF1d-EUsZiYaVGbQuqeFIszatjZg3rsdWWoQeyUJ11zYl1O0Fcvw33C3nZHSj2B321C5aPQZ6b2AyRbeQiwhaBW1d2hG7CDVzXjsvgZNILZTpZXRN8PIf5TGgt8RAlHhqJh9MynMzXDGdzRf58upKJOUxtzDjMZVyG00xR8tu_77b3925HsIK6Et60Ou19WKW63cMUPFagOBm9qgNYlm-Tp_Ho0Ci8BY-L1pkvxvVAiQ
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+probabilistic+model+checker+Storm&rft.jtitle=International+journal+on+software+tools+for+technology+transfer&rft.au=Hensel%2C+Christian&rft.au=Junges%2C+Sebastian&rft.au=Katoen%2C+Joost-Pieter&rft.au=Quatmann%2C+Tim&rft.date=2022-08-01&rft.pub=Springer+Nature+B.V&rft.issn=1433-2779&rft.eissn=1433-2787&rft.volume=24&rft.issue=4&rft.spage=589&rft.epage=610&rft_id=info:doi/10.1007%2Fs10009-021-00633-z&rft.externalDBID=HAS_PDF_LINK
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1433-2779&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1433-2779&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1433-2779&client=summon