The following pages link to CONCUR 2003 - Concurrency Theory (Q5900585):
Displaying 7 items.
- Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey (Q271706) (← links)
- Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
- Logical characterization of fluid equivalences (Q2323132) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes (Q2575731) (← links)
- Applying Formal Methods: Testing, Performance, and M/E-Commerce (Q5394041) (← links)
- Approximate Verification of the Symbolic Dynamics of Markov Chains (Q5501948) (← links)
