Pages that link to "Item:Q2576951"
From MaRDI portal
The following pages link to On finite-state approximants for probabilistic computation tree logic (Q2576951):
Displaying 8 items.
- Characterization and computation of infinite-horizon specifications over Markov processes (Q386604) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Probabilistic model checking of biological systems with uncertain kinetic rates (Q764350) (← links)
- Least upper bounds for probability measures and their applications to abstractions (Q2637319) (← links)
- Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates (Q3646252) (← links)
- Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation (Q5404082) (← links)
- Game-Based Probabilistic Predicate Abstraction in PRISM (Q5415661) (← links)
- Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations (Q5418954) (← links)
