Sciweavers

150 search results - page 24 / 30
» A bulk-synchronous parallel process algebra
Sort
View
COORDINATION
2004
Springer
15 years 3 months ago
Probabilistic and Prioritized Data Retrieval in the Linda Coordination Model
Linda tuple spaces are flat and unstructured, in the sense that they do not allow for expressing preferences of tuples; for example, we could be interested in indicating tuples th...
Mario Bravetti, Roberto Gorrieri, Roberto Lucchi, ...
CALCO
2007
Springer
112views Mathematics» more  CALCO 2007»
15 years 3 months ago
Impossibility Results for the Equational Theory of Timed CCS
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Luca Aceto, Anna Ingólfsdóttir, Moha...
JLP
2007
91views more  JLP 2007»
14 years 9 months ago
Non-bisimulation-based Markovian behavioral equivalences
The behavioral equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. One of the reasons is th...
Marco Bernardo
ENTCS
2000
97views more  ENTCS 2000»
14 years 9 months ago
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
Jirí Srba
PPSC
1989
14 years 11 months ago
Evaluating Block Algorithm Variants in LAPACK
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1...
Ed Anderson, Jack Dongarra