Pages that link to "Item:Q5418954"
From MaRDI portal
The following pages link to Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations (Q5418954):
Displaying 7 items.
- Domain theory, testing and simulation for labelled Markov processes (Q1770416) (← links)
- Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations (Q2061250) (← links)
- Automated verification and synthesis of stochastic hybrid systems: a survey (Q2097770) (← links)
- Probabilistic Marking Estimation in Labeled Petri Nets (Q2982861) (← links)
- On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context (Q2988377) (← links)
- Hyperfinite Approximations to Labeled Markov Transition Systems (Q3623930) (← links)
- Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement (Q5348126) (← links)
