Matches in SemOpenAlex for { <https://semopenalex.org/work/W177980195> ?p ?o ?g. }
- W177980195 abstract "Action hiding and probabilistic choice have independently established their roles in process algebraic modeling and verification of concurrent systems. While action hiding allows abstraction from unimportant details and model reduction, and the induced nondeterminism enables modeling uncertainty in the system behaviour, probabilistic choice allows quantification of the nondeterminism. However, as not all of the nondeterministic behaviour has a random nature, we are faced with the challenge to combine the above two aspects of concurrent systems, such that one can take maximal advantage of both. This thesis addresses two problems regarding concurrent processes that exhibit both hidden and probabilistic behaviour, or probabilistic processes for short. Namely, a proper reduction of a model, by elimination of the hidden actions, requires a semantical equivalence that preserves the process properties of interest and is a congruence for the process operators. For non-probabilistic processes it has been shown that such an equivalence is branching bisimilarity. However, in the presence of probabilistic choice, more concretely in the alternating model of probabilistic processes, the intuitive notion of branching bisimulation is not a congruence for parallel composition. In this thesis a new branching bisimulation for this model is defined, and it is shown that this is the coarsest congruence for parallel composition that is included in the former. To achieve the congruence result, a hidden action preceding directly a non-trivial probabilistic choice cannot be eliminated. The new branching bisimulation preserves the properties expressible in the probabilistic computation tree logic, and is decidable in polynomial time. Similar to the non-probabilistic case, a single axiom characterizes branching bisimilarity for finite probabilistic processes. The previous results imply that branching bisimilarity, although potentially useful for model reduction, may be in fact too strong to serve as an equivalence relation for probabilistic processes. Another view, taken in the may/must testing theory (as well as in the process calculus CSP), is to distinguish two processes only if they can be distinguished when interacting with their environment, i.e. with another process. However, although processes that differ only in the moment an internal (nondeterministic) choice is made are not distinguished by this theory, for probabilistic processes this is no longer valid. The problem stems from an earlier observation that the schedulers that resolve the nondeterminism in concurrent probabilistic processes are too powerful and yield unrealistic overestimations of the probabilities with which a process can pass a test. The power of the schedulers comes from the fact that they allow the same choice to be resolved in different manners in different futures. In order to restrict the schedulers and thus to obtain the right probabilities, this thesis proposes integrating the information, based on which a nondeterministic choice is resolved, in labels on the nondeterministic transitions. In this way, choices using the same information are resolved in the same way, regardless of the considered future. As a result, the new testing preorder relation can be characterized by a probabilistic ready-trace preorder, a relation that is insensitive to the moment an internal choice is made, yet sensitive to deadlock and to action priorities. In other words, it combines useful features of both the bisimulation-style and the trace-style relations. The parallel composition is also generalized here to include both interleaving and action hiding after synchronization, and it is shown that probabilistic ready-trace preorder is a precongruence with respect to it. Finally, the CSP-style axiomatic characterization shows that all the distributivity laws for nondeterministic choice from CSP are preserved and no new laws are added." @default.
- W177980195 created "2016-06-24" @default.
- W177980195 creator A5060758353 @default.
- W177980195 date "2011-01-01" @default.
- W177980195 modified "2023-09-23" @default.
- W177980195 title "Probability and hiding in concurrent processes" @default.
- W177980195 cites W135832138 @default.
- W177980195 cites W138290785 @default.
- W177980195 cites W1484113995 @default.
- W177980195 cites W1487199072 @default.
- W177980195 cites W1488955409 @default.
- W177980195 cites W1489359924 @default.
- W177980195 cites W1497421547 @default.
- W177980195 cites W1498432056 @default.
- W177980195 cites W1499934958 @default.
- W177980195 cites W1501731334 @default.
- W177980195 cites W1501881008 @default.
- W177980195 cites W1519485122 @default.
- W177980195 cites W1522399524 @default.
- W177980195 cites W1522479539 @default.
- W177980195 cites W1533361503 @default.
- W177980195 cites W1541979851 @default.
- W177980195 cites W1551707370 @default.
- W177980195 cites W1555835764 @default.
- W177980195 cites W1569427085 @default.
- W177980195 cites W1577673148 @default.
- W177980195 cites W1579183220 @default.
- W177980195 cites W1580405793 @default.
- W177980195 cites W1582665553 @default.
- W177980195 cites W1595139336 @default.
- W177980195 cites W1597386479 @default.
- W177980195 cites W1597655219 @default.
- W177980195 cites W1605071730 @default.
- W177980195 cites W1607148385 @default.
- W177980195 cites W1736113712 @default.
- W177980195 cites W173641204 @default.
- W177980195 cites W1739770529 @default.
- W177980195 cites W1810681804 @default.
- W177980195 cites W1850900101 @default.
- W177980195 cites W1851152565 @default.
- W177980195 cites W1879271770 @default.
- W177980195 cites W1935088456 @default.
- W177980195 cites W1969947545 @default.
- W177980195 cites W1972478730 @default.
- W177980195 cites W1974090207 @default.
- W177980195 cites W1976268573 @default.
- W177980195 cites W1985161650 @default.
- W177980195 cites W1990183105 @default.
- W177980195 cites W1996582785 @default.
- W177980195 cites W2005998857 @default.
- W177980195 cites W2012948837 @default.
- W177980195 cites W2020577539 @default.
- W177980195 cites W2020876738 @default.
- W177980195 cites W2028145673 @default.
- W177980195 cites W2030875267 @default.
- W177980195 cites W2034188142 @default.
- W177980195 cites W2037507558 @default.
- W177980195 cites W2039139411 @default.
- W177980195 cites W2051580064 @default.
- W177980195 cites W2052170634 @default.
- W177980195 cites W2056928795 @default.
- W177980195 cites W2071659383 @default.
- W177980195 cites W2076337359 @default.
- W177980195 cites W2078717493 @default.
- W177980195 cites W2083770991 @default.
- W177980195 cites W2096009691 @default.
- W177980195 cites W2099863033 @default.
- W177980195 cites W2100781580 @default.
- W177980195 cites W2101170002 @default.
- W177980195 cites W2102097307 @default.
- W177980195 cites W2103718058 @default.
- W177980195 cites W2107144615 @default.
- W177980195 cites W2108176668 @default.
- W177980195 cites W2109146692 @default.
- W177980195 cites W2110586188 @default.
- W177980195 cites W2110763517 @default.
- W177980195 cites W2113599430 @default.
- W177980195 cites W2118954772 @default.
- W177980195 cites W2125382028 @default.
- W177980195 cites W2126092129 @default.
- W177980195 cites W2126214140 @default.
- W177980195 cites W2127262933 @default.
- W177980195 cites W2127452188 @default.
- W177980195 cites W2129136797 @default.
- W177980195 cites W2129384397 @default.
- W177980195 cites W2130773382 @default.
- W177980195 cites W2131064513 @default.
- W177980195 cites W2133712643 @default.
- W177980195 cites W2135324040 @default.
- W177980195 cites W2135367671 @default.
- W177980195 cites W2135795876 @default.
- W177980195 cites W2136920408 @default.
- W177980195 cites W2137250214 @default.
- W177980195 cites W2137865376 @default.
- W177980195 cites W2140700734 @default.
- W177980195 cites W2151272968 @default.
- W177980195 cites W2152206644 @default.
- W177980195 cites W2153717963 @default.
- W177980195 cites W2157144873 @default.
- W177980195 cites W2158942489 @default.