Show simple item record

dc.contributor.authorSong, S
dc.contributor.authorGui, L
dc.contributor.authorSun, J
dc.contributor.authorLiu, Y
dc.contributor.authorDong, JS
dc.date.accessioned2017-10-24T04:17:43Z
dc.date.available2017-10-24T04:17:43Z
dc.date.issued2013
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-642-38613-8_12
dc.identifier.urihttp://hdl.handle.net/10072/172899
dc.description.abstractDiscrete Time Markov Chains (DTMCs) are widely used to model probabilistic systems in many domains, such as biology, network and communication protocols. There are two main approaches for probability reachability analysis of DTMCs, i.e., solving linear equations or using value iteration. However, both approaches have drawbacks. On one hand, solving linear equations can generate accurate results, but it can be only applied to relatively small models. On the other hand, value iteration is more scalable, but often suffers from slow convergence. Furthermore, it is unclear how to parallelize (i.e., taking advantage of multi-cores or distributed computers) these two approaches. In this work, we propose a divide-and-conquer approach to eliminate loops in DTMC and hereby speed up probabilistic reachability analysis. A DTMC is separated into several partitions according to our proposed cutting criteria. Each partition is then solved by Gauss-Jordan elimination effectively and the state space is reduced afterwards. This divide and conquer algorithm will continue until there is no loop existing in the system. Experiments are conducted to demonstrate that our approach can generate accurate results, avoid the slow convergence problems and handle larger models.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofpagefrom162
dc.relation.ispartofpageto176
dc.relation.ispartofjournalLecture Notes in Computer Science
dc.relation.ispartofvolume7940 LNCS
dc.subject.fieldofresearchSoftware engineering not elsewhere classified
dc.subject.fieldofresearchcode461299
dc.titleImproved reachability analysis in DTMC via divide and conquer
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.hasfulltextNo Full Text
gro.griffith.authorDong, Jin-Song


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record