翻訳と辞書 Words near each other ・ Bisi Adeleye-Fayemi ・ Bisi Alimi ・ Bisi Bele Bath ・ Bisi Ezerioha ・ Bisi Komolafe ・ Bisi Onasanya ・ Bisi Silva ・ Bisi, KwaZulu-Natal ・ Bisichi Mining ・ Bisie ・ Bisig, Valenzuela ・ Bisigna procerella ・ Bisignano ・ Bisila Bokoko ・ Bisimbre ・ Bisimulation ・ Bisin ・ Bisin, Syria ・ Bisinchi ・ Bisindolylmaleimide ・ Bisingen ・ Bisinus ・ Bisinusia ・ Bisira ・ Bisis language ・ Bisitun Cave ・ Bisj pole ・ Bisk ・ Bisk Farm ・ Biskau Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Bisimulation ： ウィキペディア英語版 Bisimulation In theoretical computer science a bisimulation is a binary relation between state transition systems, associating systems that behave in the same way in the sense that one system simulates the other and vice versa. Intuitively two systems are bisimilar if they match each other's moves. In this sense, each of the systems cannot be distinguished from the other by an observer. == Formal definition == Given a labelled state transition system ($S$, Λ, →), a ''bisimulation'' relation is a binary relation $R$ over $S$ (i.e., $R$ ⊆ $S$ × $S$) such that both $R$−1 and $R$ are simulations. Equivalently $R$ is a bisimulation if for every pair of elements $p,\; q$ in $S$ with $(p,q)$ in $R$, for all α in Λ: for all $p\text{'}$ in $S$, ::$$ p \overset p' :implies that there is a $q\text{'}$ in $S$ such that ::$$ q \overset q' :and $(p\text{'},q\text{'})\; \backslash in\; R$; and, symmetrically, for all $q\text{'}$ in $S$ ::$$ q \overset q' :implies that there is a $p\text{'}$ in $S$ such that ::$$ p \overset p' :and $(p\text{'},q\text{'})\; \backslash in\; R$. Given two states $p$ and $q$ in $S$, $p$ is bisimilar to $q$, written $p\; \backslash ,\; \backslash sim\; \backslash ,\; q$, if there is a bisimulation $R$ such that $(p,\; q)$ is in $R$. The bisimilarity relation $\backslash ,\; \backslash sim\; \backslash ,$ is an equivalence relation. Furthermore, it is the largest bisimulation relation over a given transition system. Note that it is not always the case that if $p$ simulates $q$ and $q$ simulates $p$ then they are bisimilar. For $p$ and $q$ to be bisimilar, the simulation between $p$ and $q$ must be the inverse of the simulation between $q$ and $p$. Counter-example (in CCS, describing a coffee machine) : $M=p.\backslash overline.M+p.\backslash overline.M+p.(\backslash overline.M+\backslash overline.M)$ and $M\text{'}=p.(\backslash overline.M\text{'}+\backslash overline.M\text{'})$ simulate each other but are not bisimilar. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Bisimulation」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.