The following pages link to STACS 2005 (Q5710687):
Displaying 20 items.
- Querying probabilistic business processes for sub-flows (Q359875) (← links)
- Determinacy and optimal strategies in infinite-state stochastic reachability games (Q391114) (← links)
- Branching-time model-checking of probabilistic pushdown automata (Q394999) (← links)
- Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
- Consistency of stochastic context-free grammars (Q611793) (← links)
- Computation of distances for regular and context-free probabilistic languages (Q932320) (← links)
- CSL model checking algorithms for QBDs (Q995462) (← links)
- A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Axiomatizing rational power series over natural numbers (Q2389332) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- Carrying Probabilities to the Infinite World (Q3090817) (← links)
- Two Variable vs. Linear Temporal Logic in Model Checking and Games (Q3090852) (← links)
- Newton’s Method for ω-Continuous Semirings (Q3520300) (← links)
- Derivation Tree Analysis for Accelerated Fixed-Point Computation (Q3533020) (← links)
- (Q5009450) (← links)
- Branching-Time Model-Checking of Probabilistic Pushdown Automata (Q5179051) (← links)
- Efficient Analysis of Probabilistic Programs with an Unbounded Counter (Q5501946) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703763) (← links)
- Certificates for probabilistic pushdown automata via optimistic value iteration (Q6536144) (← links)
