Results 1  10
of
3,387,191
Regular expressions in process algebra
 In LICS ’05
, 2005
"... We tackle an open question of Milner ([10]). We define a set of socalled wellbehaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions. 1 ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We tackle an open question of Milner ([10]). We define a set of socalled wellbehaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of regular expressions. 1
Abstract LIX Colloquium 2006 Expressiveness of Process Algebras
"... We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature. ..."
Abstract
 Add to MetaCart
We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature.
A Note on Expressiveness of Process Algebra
"... We extend the work of Baeten, Bergstra & Klop by showing that every recursively enumerable transition system can be expressed in process algebra up to weak bisimulation. The various forms of process algebra (CCS [5], CSP [4], ACP [2]) are known to have universal computing power, in the sense tha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We extend the work of Baeten, Bergstra & Klop by showing that every recursively enumerable transition system can be expressed in process algebra up to weak bisimulation. The various forms of process algebra (CCS [5], CSP [4], ACP [2]) are known to have universal computing power, in the sense
www.elsevier.com/locate/entcs Expressiveness of Process Algebras
"... We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature. ..."
Abstract
 Add to MetaCart
We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature.
Using Linear Algebra for Intelligent Information Retrieval
 SIAM REVIEW
, 1995
"... Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical ..."
Abstract

Cited by 672 (18 self)
 Add to MetaCart
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. Because of the tremendous diversity in the words people use to describe the same document, lexical methods are necessarily incomplete and imprecise. Using the singular value decomposition (SVD), one can take advantage of the implicit higherorder structure in the association of terms with documents by determining the SVD of large sparse term by document matrices. Terms and documents represented by 200300 of the largest singular vectors are then matched against user queries. We call this retrieval method Latent Semantic Indexing (LSI) because the subspace represents important associative relationships between terms and documents that are not evident in individual documents. LSI is a completely automatic yet intelligent indexing method, widely applicable, and a promising way to improve users...
A calculus of mobile processes, I
, 1992
"... We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract

Cited by 1183 (31 self)
 Add to MetaCart
We present the acalculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage
Algebraic laws for nondeterminism and concurrency
 Journal of the ACM
, 1985
"... Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. Firs ..."
Abstract

Cited by 600 (13 self)
 Add to MetaCart
observation congruence class. The paper demonstrates, for a sequence of simple languages expressing finite (terminating) behaviors, that in each case observation congruence can be axiomatized algebraically. Moreover, with the addition of recursion and another simple extension, the algebraic language described
Parallel Numerical Linear Algebra
, 1993
"... We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We illust ..."
Abstract

Cited by 766 (23 self)
 Add to MetaCart
We survey general techniques and open problems in numerical linear algebra on parallel architectures. We first discuss basic principles of parallel processing, describing the costs of basic operations on parallel machines, including general principles for constructing efficient algorithms. We
Homological Algebra of Mirror Symmetry
 in Proceedings of the International Congress of Mathematicians
, 1994
"... Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual Ca ..."
Abstract

Cited by 529 (3 self)
 Add to MetaCart
Mirror Symmetry was discovered several years ago in string theory as a duality between families of 3dimensional CalabiYau manifolds (more precisely, complex algebraic manifolds possessing holomorphic volume elements without zeroes). The name comes from the symmetry among Hodge numbers. For dual
Qualitative process theory
 MIT AI Lab Memo
, 1982
"... Objects move, collide, flow, bend, heat up, cool down, stretch, compress. and boil. These and other things that cause changes in objects over time are intuitively characterized as processes. To understand commonsense physical reasoning and make programs that interact with the physical world as well ..."
Abstract

Cited by 884 (92 self)
 Add to MetaCart
Objects move, collide, flow, bend, heat up, cool down, stretch, compress. and boil. These and other things that cause changes in objects over time are intuitively characterized as processes. To understand commonsense physical reasoning and make programs that interact with the physical world as well
Results 1  10
of
3,387,191