PL
 |
EN
Ograniczanie wyników
Czasopisma help
  1. 2 Fundamenta Informaticae
Autorzy help
  1. 2 Doberkat E.-E.
Lata help
  1. 2 2005
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  probabilistic relations
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Tracing Relations Probabilistically
Doberkat E.-E.
Fundamenta Informaticae
|
2005
|
Vol. 65, nr 3
193--209
EN
We investigate similarities between non-deterministic and probabilistic ways of describing a system in terms of computation trees. We show that the construction of traces for both kinds of relations follows the same principles of construction. Representations of measurable trees in terms of probabilistic relations are given. This shows that stochastic relations may serve as refinements of their non-deterministic counterparts. A convexity argument formalizes the observation that non-deterministic system descriptions are underspecified when compared to probabilistic ones. The mathematical tools come essentially from the theory of measurable selections.
2
Content available remote Tracing Relations Probabilistically
Doberkat E.-E.
Fundamenta Informaticae
|
2005
|
Vol. 66, nr 3
259--275
EN
We investigate similarities between non-deterministic and probabilistic ways of describing a system in terms of computation trees. We show that the construction of traces for both kinds of relations follows the same principles of construction. Representations of measurable trees in terms of probabilistic relations are given. This shows that stochastic relations may serve as refinements of their non-deterministic counterparts. A convexity argument formalizes the observation that non-deterministic system descriptions are underspecified when compared to probabilistic ones. The mathematical tools come essentially from the theory of measurable selections.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.