|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| | | Hi there. Allow me start by introducing the writer, her name is Sophia Boon but she never truly liked that title. Alaska is the only place I've been residing in but now I'm considering other choices. She functions as a travel agent but quickly she'll be on her own. To climb is something she would never give up.<br><br>Here is my web page :: [http://m-card.co.kr/xe/mcard_2013_promote01/29877 free psychic readings] |
| In [[theoretical computer science]], '''probabilistic bisimulation''' is an extension of the concept of [[bisimulation]] for fully probabilistic [[state transition system|transition systems]] first described by [[K.G. Larsen]] and [[A. Skou]].<ref>K. G. Larsen and A. Skou and appeared in the article ''Bisimulation through Probabilistic Testing'', published in Information and Computation, vol 94, pages 1-28, 1991</ref>
| |
| | |
| A discrete probabilistic transition system is a triple
| |
| | |
| : <math>S = (\operatorname{St}, \operatorname{Act}, \tau:\operatorname{St} \times \operatorname{Act}\times \operatorname{St}\rightarrow [0,1])</math>
| |
| | |
| where <math>\tau(s,a,t)</math> gives the probability of starting in the state ''s'', performing the action ''a'' and ending up in the state ''t''. The set of states is assumed to be countable. There is no attempt to assign probabilities to actions. It is assumed that the actions are chosen nondeterministically by an adversary or by the environment. This type of system is fully probabilistic, there is no other indeterminacy.
| |
| | |
| The definition of a probabilistic bisimulation on a system ''S'' is an equivalence relation ''R'' on the state space St, such that for every pair ''s'',''t'' in St with sRt and for every action a in Act and for every equivalence class ''C'' of ''R''
| |
| <math>\tau(s,a,C) = \tau(t,a,C).</math> Two states are said to be probabilistically bisimilar if there is some such ''R'' relating them. | |
| | |
| When applied to [[Markov chains]], probabilistic bisimulation is the same concept as [[lumpability]].<ref>[http://ieeexplore.ieee.org/ielx5/8606/27273/01212701.pdf?arnumber=1212701 Probabilistic Noninterference through Weak Probabilistic Bisimulation] by Geoffrey Smith Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW’03) 1063-6900/03</ref><ref>
| |
| {{cite book
| |
| | first = John G.
| |
| | last = Kemeny
| |
| | author-link = John George Kemeny
| |
| | first2 = J. Laurie
| |
| | last2 = Snell
| |
| | editor-first = F. W.
| |
| | editor-last = Gehring
| |
| | editor2-first = P. R.
| |
| | editor2-last = Halmos
| |
| | title = Finite Markov Chains
| |
| | edition = Second
| |
| | origyear = 1960
| |
| | year = 1976
| |
| | month = July
| |
| | publisher = Springer-Verlag
| |
| | location = New York Berlin Heidelberg Tokyo
| |
| | language = English
| |
| | isbn = 978-0-387-90192-3
| |
| | pages = 224
| |
| }}</ref>
| |
| | |
| ==References==
| |
| | |
| {{Reflist}}
| |
| | |
| [[Category:Theoretical computer science]]
| |
Hi there. Allow me start by introducing the writer, her name is Sophia Boon but she never truly liked that title. Alaska is the only place I've been residing in but now I'm considering other choices. She functions as a travel agent but quickly she'll be on her own. To climb is something she would never give up.
Here is my web page :: free psychic readings