121
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
107
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
127
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
117
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
84
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE