26 resultados para probabilistic refinement calculus

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

20.00% 20.00%

Publicador:

Resumo:

An application of the heterogeneous variables system prediction method to solving the time series analysis problem with respect to the sample size is considered in this work. It is created a logical-and-probabilistic correlation from the logical decision function class. Two ways is considered. When the information about event is kept safe in the process, and when it is kept safe in depending process.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

∗ The work is partially supported by NSFR Grant No MM 409/94.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The paper contains calculus rules for coderivatives of compositions, sums and intersections of set-valued mappings. The types of coderivatives considered correspond to Dini-Hadamard and limiting Dini-Hadamard subdifferentials in Gˆateaux differentiable spaces, Fréchet and limiting Fréchet subdifferentials in Asplund spaces and approximate subdifferentials in arbitrary Banach spaces. The key element of the unified approach to obtaining various calculus rules for various types of derivatives presented in the paper are simple formulas for subdifferentials of marginal, or performance functions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The problem of finite automata minimization is important for software and hardware designing. Different types of automata are used for modeling systems or machines with finite number of states. The limitation of number of states gives savings in resources and time. In this article we show specific type of probabilistic automata: the reactive probabilistic finite automata with accepting states (in brief the reactive probabilistic automata), and definitions of languages accepted by it. We present definition of bisimulation relation for automata's states and define relation of indistinguishableness of automata states, on base of which we could effectuate automata minimization. Next we present detailed algorithm reactive probabilistic automata’s minimization with determination of its complexity and analyse example solved with help of this algorithm.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A33, 33C20.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A33, 33E12, 33C20.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 43A20, 26A33 (main), 44A10, 44A15

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 30C45, Secondary 26A33, 30C80

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 44A15, 33D15, 81Q99

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Class.: 33C10,33D60,26D15,33D05,33D15,33D90

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A33, 93C83, 93C85, 68T40

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 46F25, 26A33; Secondary: 46G20

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 26A33, 33C60, 44A20

Relevância:

20.00% 20.00%

Publicador:

Resumo:

MSC 2010: 44A20, 33C60, 44A10, 26A33, 33C20, 85A99

Relevância:

20.00% 20.00%

Publicador:

Resumo:

MSC 2010: 26A33, 05C72, 33E12, 34A08, 34K37, 35R11, 60G22