The following pages link to CONCUR 2005 – Concurrency Theory (Q5897480):
Displaying 12 items.
- General quantitative specification theories with modal transition systems (Q404008) (← links)
- A modal characterization of alternating approximate bisimilarity (Q479808) (← links)
- Approximate bisimulation: a bridge between computer science and control theory (Q693690) (← links)
- On metrics for probabilistic systems: definitions and algorithms (Q971582) (← links)
- Characterize branching distance in terms of \((\eta , \alpha )\)-bisimilarity (Q1004387) (← links)
- How adaptive and reliable is your program? (Q2117013) (← links)
- A quantified coalgebraic van Benthem theorem (Q2233433) (← links)
- Recursively defined metric spaces without contraction (Q2373743) (← links)
- The quantitative linear-time-branching-time spectrum (Q2453109) (← links)
- Monads and Quantitative Equational Theories for Nondeterminism and Probability (Q5089294) (← links)
- A Behavioural Pseudometric based on λ–Bisimilarity (Q5415666) (← links)
- A framework to measure the robustness of programs in the unpredictable environment (Q6135769) (← links)
