| Body na spoluautora | Body za publikaci pro MU | Odkaz ISVaV | | 0,00 | 0,00 | Qualitative Reachability in Stochastic BPA Games
|
| 7,22 | 14,45 | Characteristic Patterns for LTL
|
| 6,16 | 12,32 | Characteristic Patterns for LTL
|
| 7,22 | 14,45 | Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion
|
| 9,72 | 19,44 | The stuttering principle revisited
|
| 4,82 | 14,45 | On the Decidability of Temporal Properties of Probabilistic Pushdown Automata
|
| 7,22 | 14,45 | On the Controller Synthesis for Finite-State Markov Decision Processes
|
| 6,16 | 12,32 | On the Controller Synthesis for Finite-State Markov Decision Processes
|
| 14,45 | 14,45 | Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances
|
| 0,00 | 0,00 | Pre-Proceedings of 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2005)
|
| 7,22 | 14,45 | Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
|
| 6,16 | 12,32 | Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
|
| 6,32 | 12,64 | Equivalence-Checking on Infinite-State Systems: Techniques and Results
|
| 0,00 | 0,00 | Model Checking Probabilistic Pushdown Automata
|
| 20,12 | 20,12 | Methods for Quantitative Analysis of Probabilistic Pushdown Automata
|
| 0,00 | 0,00 | Proceedings of the Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006)
|
| 7,55 | 30,19 | Reachability in Recursive Markov Decision Processes
|
| 3,61 | 14,45 | Reachability in Recursive Markov Decision Processes
|
| 8,87 | 17,74 | On the Controller Synthesis for Finite-State Markov Decision Processes
|
| 3,61 | 14,45 | The Satisfiability Problem for Probabilistic CTL
|
| 15,45 | 61,80 | Reachability in Recursive Markov Decision Processes
|
| 4,82 | 14,45 | Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
|
| 5,62 | 16,86 | Deciding probabilistic bisimilarity over infinite-state probabilistic systems
|
| 3,61 | 14,45 | Discounted Properties of Probabilistic Pushdown Automata
|
| 0,00 | 0,00 | Continuous-Time Stochastic Games with Time-Bounded Reachability
|
| 7,22 | 14,45 | Stochastic Game Logic
|
| 3,61 | 14,45 | Stochastic Games with Branching-Time Winning Objectives
|
| 17,72 | 17,72 | A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
|
Back
(c) Michal Bulant, 2011