Sciweavers

1012 search results - page 4 / 203
» Process Algebra with Backtracking
Sort
View
ENTCS
2008
94views more  ENTCS 2008»
13 years 7 months ago
Expressiveness of Process Algebras
We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature.
Joachim Parrow
FUIN
2002
89views more  FUIN 2002»
13 years 7 months ago
Process Algebra with Nonstandard Timing
The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with t...
Kees Middelburg
AAAI
1996
13 years 9 months ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
CALCO
2005
Springer
76views Mathematics» more  CALCO 2005»
14 years 1 months ago
Strong Splitting Bisimulation Equivalence
We present ACPc , a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms fo...
Jan A. Bergstra, C. A. Middelburg
CONCUR
1991
Springer
13 years 11 months ago
Real Space Process Algebra
We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap....
Jos C. M. Baeten, Jan A. Bergstra