Incremental Bisimulation Abstraction Refinement

Song, Lei; Zhang, Lijun; Hermanns, Holger; Godskesen, Jens Chr.

doi:10.1145/2627352

Cited by 3 publications

(3 citation statements)

References 39 publications

(47 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several different abstraction approaches have been proposed for probabilistic systems [12,21,27,17,9,25,29]. Our work builds on the game-based abstraction refinement algorithm presented in [25,18].…”

Section: Related Workmentioning

confidence: 99%

Towards Abstraction-based Probabilistic Program Analysis

Szekeres

Majzik

2023

Acta Cybern

View full text Add to dashboard Cite

Probabilistic programs that can represent both probabilistic and non-deterministic choices are useful for creating reliability models of complex safety-critical systems that interact with humans or external systems. Such models are often quite complex, so their analysis can be hindered by state-space explosion. One common approach to deal with this problem is the application of abstraction techniques. We present improvements for an abstraction-refinement scheme for the analysis of probabilistic programs, aiming to improve the scalability of the scheme by adapting modern techniques from qualitative software model checking, and make the analysis result more reliable using better convergence checks. We implemented and evaluated the improvements in our Theta model checking framework.

show abstract

Section: Related Workmentioning

confidence: 99%

Towards Abstraction-based Probabilistic Program Analysis

Szekeres

Majzik

2023

Acta Cybern

View full text Add to dashboard Cite

show abstract

“…An approach was proposed [384] to accelerate the model checking of PCTL formulas on probabilistic automata, by iteratively refining an abstraction of a probabilistic automaton, using incrementally computed bisimulations and without resorting to any kind of counterexample analysis.…”

Section: Bisimulation Tools For Probabilistic and Stochastic Systemsmentioning

confidence: 99%

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

Garavel

Lang

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Equivalence checking is a formal verification approach that consists in proving that two programs or models are related modulo some equivalence relation, or that one is included in the other modulo some preorder relation. In the case of concurrent systems, which are often represented using labelled transition systems, the relations used for equivalence checking are bisimulations and their simulation preorders. In the case of probabilistic or stochastic systems, which are usually represented using Markov chains, the relations used for equivalence checking are lumpability, probabilistic and stochastic equivalences, and their associated preorders. The present article provides a synthetic overview of 40 years of research in the design of algorithms and software tools for equivalence checking.

show abstract

“…In the same vein, Dehnert et al proposed symbolic probabilistic bisimulation minimisation to reduce computation time for model checking PCTL in a setting for DTMCs [13], where an SMT solver is exploited to do the splitting of blocks. Partition reduction modulo probabilistic bisimulation is also used as an ingredient in a counter-example guided abstraction refinement approach (CEGAR) for model checking for PCTL by Lei Song et al in [14].…”

Section: Related Workmentioning

confidence: 99%

An Efficient Algorithm to Determine Probabilistic Bisimulation

2018

View full text Add to dashboard Cite

We provide an algorithm to efficiently compute bisimulation for probabilistic labeled transition systems, featuring non-deterministic choice as well as discrete probabilistic choice. The algorithm is linear in the number of transitions and logarithmic in the number of states, distinguishing both action states and probabilistic states, and the transitions between them. The algorithm improves upon the proposed complexity bounds of the best algorithm addressing the same purpose so far by Baier, Engelen and Majster-Cederbaum (Journal of Computer and System Sciences 60:187–231, 2000). In addition, experimentally, on various benchmarks, our algorithm performs rather well; even on relatively small transition systems, a performance gain of a factor 10,000 can be achieved.

show abstract

Incremental Bisimulation Abstraction Refinement

Cited by 3 publications

References 39 publications

Towards Abstraction-based Probabilistic Program Analysis

Towards Abstraction-based Probabilistic Program Analysis

Equivalence Checking 40 Years After: A Review of Bisimulation Tools

An Efficient Algorithm to Determine Probabilistic Bisimulation

Contact Info

Product

Resources

About