Name
Abstract | ||
|---|---|---|
In this paper we propose a metric for finite processes in a probabilistic extension of CSP. The kernel of the metric corresponds to trace equivalence and most of the operators in the process algebra is shown to satisfy non-expansiveness property with respect to this metric. We also provide an algorithm to calculate the distance between two processes to a prescribed discount factor in polynomial time. The algorithm has been implemented in a tool that helps us to measure processes automatically. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/QSIC.2007.4385480 | QSIC |
Keywords | Field | DocType |
metric cor,towards automatic measurement,polynomial time,probabilistic processes,finite process,computational complexity,prescribed discount factor,trace equivalence,directed graphs,probabilistic extension,non-expansiveness property,process algebra,csp,probability,satisfiability | Kernel (linear algebra),Computer science,Directed graph,Real-time computing,Theoretical computer science,Equivalence (measure theory),Operator (computer programming),Probabilistic logic,Time complexity,Process calculus,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1550-6002 | 978-0-7695-3035-2 | 7 |
PageRank | References | Authors |
0.45 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lin Song | 1 | 119 | 9.00 |
| Yuxin Deng | 2 | 413 | 30.41 |
| Xiaojuan Cai | 3 | 36 | 5.95 |