The following pages link to CONCUR 2003 - Concurrency Theory (Q5900584):
Displaying 8 items.
- Approximating Markov processes through filtration (Q442296) (← links)
- When are stochastic transition systems tameable? (Q1648646) (← links)
- Bisimulation for Feller-Dynkin processes (Q2133163) (← links)
- Borel kernels and their approximation, categorically (Q2134827) (← links)
- On finite-state approximants for probabilistic computation tree logic (Q2576951) (← links)
- Labelled Markov processes: stronger and faster approximations (Q2844076) (← links)
- Approximating Labelled Markov Processes Again! (Q2888484) (← links)
- Approximating Markov Processes by Averaging (Q5895176) (← links)