Probabilistic Bisimulation for Realistic Schedulers

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

doi:10.1007/978-3-319-19249-9_16

Cited by 5 publications

(2 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Section 5 concludes the paper. A discussion why all results established in this paper directly carry over to Markov automata can be found in [12].…”

mentioning

confidence: 96%

Probabilistic bisimulation for realistic schedulers

et al. 2018

View full text Add to dashboard Cite

Weak distribution bisimilarity is an equivalence notion on probabilistic automata, originally proposed for Markov automata. It has gained some popularity as the coarsest behavioral equivalence enjoying valuable properties like preservation of trace distribution equivalence and compositionality. This holds in the classical context of arbitrary schedulers, but it has been argued that this class of schedulers is unrealistically powerful. This paper studies a strictly coarser notion of bisimilarity, which still enjoys these properties in the context of realistic subclasses of schedulers: Trace distribution equivalence is implied for partial information schedulers, and compositionality is preserved by distributed schedulers. The intersection of the two scheduler classes thus spans a coarser and still reasonable compositional theory of behavioral semantics.

show abstract

“…Section 5 concludes the paper. A discussion why all results established in this paper directly carry over to Markov automata can be found in [12].…”

mentioning

confidence: 96%

Probabilistic bisimulation for realistic schedulers

et al. 2018

View full text Add to dashboard Cite

show abstract

“…The research of verification, which is the core research in model checking, focuses on two lines. One of them is to develop new algorithms for the verification of new systems or properties, e.g., [13,39,46,80,87,171,181,193].…”

Section: Motivations and Goalsmentioning

confidence: 99%

Parallelizing model checking algorithms using multi-core and many-core architectures

Wu¹

View full text Add to dashboard Cite

The reliance on the functioning of software systems is growing with the development of IT industry. The complexity and scalability to design these systems are increasing, especially for concurrent systems with concurrent executions, communications and resource distributions, e.g., classical cryptography protocols and quantum communication systems. Thus, the reliability of these systems becomes crucial. Model checking is an automated verification approach to validate these complicated systems, which has been proved to be effective in discovering errors. Model checking works through the exploration of all possible system states in a brute force manner. This technique checks whether a system model meets a given specification, and it consists of system modeling, requirement specification, and verification. Compared to other traditional approaches, e.g., simulation, testing, and My deepest gratitude goes first and foremost to my supervisor Prof. Yang Liu, for his constant encouragement and guidance. He has provided me great supports throughout my Ph.D. study on developing new research ideas, critical thinking and technical writing. Besides, he has walked me through all the stages of the writing of this thesis. His consistent and illuminating instruction really helps me to shape my research. Secondly, I am grateful to Prof. Binsheng He and Prof. Rong su, who were in my Thesis Advisory Committee, for their valuable suggestions and comments to my research works. Thirdly, I want to show my gratitude to Prof. Yuan Feng, Prof. Jun Sun, Prof. Yun Liang and Prof. Shengchao Qin. They have always given me instructions on my research publications.

show abstract

Non-bisimulation Based Behavioral Relations for Markov Automata

Sharma

2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Probabilistic Bisimulation for Realistic Schedulers

Cited by 5 publications

References 34 publications

Probabilistic bisimulation for realistic schedulers

Probabilistic bisimulation for realistic schedulers

Parallelizing model checking algorithms using multi-core and many-core architectures

Non-bisimulation Based Behavioral Relations for Markov Automata

Contact Info

Product

Resources

About