Bisimulation through probabilistic testing (Q1175940): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Kim Guldstrand Larsen / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Damas Gruska / rank | |||
Normal rank |
Revision as of 18:04, 19 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bisimulation through probabilistic testing |
scientific article |
Statements
Bisimulation through probabilistic testing (English)
0 references
25 June 1992
0 references
A test language and a notion of probabilistic testability of concurrent process properties are presented. Properties expressed as formulas within Hennessy-Milner logic are testable and as a consequence non-bisimilar processes can be distinguished through testing. A new process relation called \({2\over3}\)-bisimulation is introduced. The relation lies strictly between that of simulation and bisimulation. For probabilistic transition systems for which there is a limit to the probability of transitions it is proved that two processes are \({2\over3}\)-bisimilar iff they satisfy the same limited modal logic formulas. Probabilistic modal logic is introduced and it is shown that the induced notion of probabilistic bisimilarity characterizes the limit as to the distinguishing power of the test language. The probabilistic bisimulation is strictly stronger than bisimulation.
0 references
probabilistic testing
0 references
concurrent process
0 references
Hennessy-Milner logic
0 references