Sciweavers

150 search results - page 27 / 30
» A bulk-synchronous parallel process algebra
Sort
View
FUIN
2008
89views more  FUIN 2008»
14 years 9 months ago
Is Timed Branching Bisimilarity a Congruence Indeed?
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
Wan Fokkink, Jun Pang, Anton Wijs
PR
2006
122views more  PR 2006»
14 years 9 months ago
Fast multiscale clustering and manifold identification
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
Dan Kushnir, Meirav Galun, Achi Brandt
FOSSACS
2005
Springer
15 years 3 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
BIRTHDAY
2004
Springer
15 years 3 months ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes
CONCUR
2001
Springer
15 years 2 months ago
CCS with Priority Guards
It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Va...
Iain Phillips