The following pages link to CONCUR 2003 - Concurrency Theory (Q5900586):
Displaying 13 items.
- Value-passing CCS with noisy channels (Q428864) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Approximate bisimulation: a bridge between computer science and control theory (Q693690) (← links)
- Non-expansive \(\varepsilon\)-bisimulations for probabilistic processes (Q974113) (← links)
- Tempus fugit: How to plug it (Q997994) (← links)
- The approximate correctness of systems based on \(\delta\)-bisimulation (Q1744456) (← links)
- A unified framework for differential aggregations in Markovian process algebra (Q2258842) (← links)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems (Q2272986) (← links)
- On finite-state approximants for probabilistic computation tree logic (Q2576951) (← links)
- Quantitative Abstractions for Collective Adaptive Systems (Q2822665) (← links)
- On probabilistic techniques for data flow analysis (Q2870284) (← links)
- A Behavioural Pseudometric based on λ–Bisimilarity (Q5415666) (← links)
- Reversible monadic computing (Q5971401) (← links)