Results 1  10
of
1,010
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 608 (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
Performance Analysis of the IEEE 802.11 Distributed Coordination Function
, 2000
"... Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slott ..."
Abstract

Cited by 1869 (1 self)
 Add to MetaCart
slotted exponential backoff. This paper provides a simple, but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions. The proposed analysis applies to both the packet transmission schemes
Semantic foundations of concurrent constraint programming
, 1990
"... Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a constr ..."
Abstract

Cited by 276 (27 self)
 Add to MetaCart
constraint (a finite representation of a possibly infinite set of valuations) which provides partial information about the possible values that variables can take. Instead of “reading” and “writing ” the values of variables, processes may now ask (check if a constraint is entailed by the store) and tell
Byzantine disk paxos: optimal resilience with Byzantine shared memory
 Distributed Computing
, 2006
"... We present Byzantine Disk Paxos, an asynchronous sharedmemory consensus protocol that uses a collection of n> 3t disks, t of which may fail by becoming nonresponsive or arbitrarily corrupted. We give two constructions of this protocol; that is, we construct two different building blocks, each of ..."
Abstract

Cited by 48 (3 self)
 Add to MetaCart
operations are guaranteed to return only in executions with a finite number of writes. We call this termination condition finite writes (FW), and show that consensus is solvable with FWterminating registers and a leader oracle. We construct each of these reliable registers from n> 3t base registers
Termination of probabilistic concurrent programs
 ACM Transactions on Programming Languages and Systems
, 1983
"... The asynchronous execution behavior of several concurrent processes, which may use randomization, is studied. Viewing each process as a discrete Markov chain over the set of common execution states, we give necessary and sufficient conditions for the processes to converge almost surely to a given se ..."
Abstract

Cited by 73 (2 self)
 Add to MetaCart
set of goal states, under any fair, but otherwise arbitrary schedule, provided that the state space is finite. (These conditions can be checked mechanically.) An interesting feature of the proof method is that it depends only on the topology of the transitions and not on the actual values
Generalized Sufficient Conditions for Modular Termination of Rewriting
 IN ENGINEERING, COMMUNICATION AND COMPUTING
, 1992
"... Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint unions, have attracted an increasing attention within the last few years. Whereas confluence is modular this does not hold true in general for termination. By means of a careful analysis of potential cou ..."
Abstract

Cited by 52 (8 self)
 Add to MetaCart
counterexamples we prove the following abstract result. Whenever the disjoint union R1 \Phi R2 of two (finitely branching) terminating term rewriting systems R1 , R2 is nonterminating, then one of the systems, say R1 , enjoys an interesting (undecidable) property, namely it is not termination preserving under
Finite termination of asynchronous iterative algorithms
 Parallel Computing
, 1996
"... Abstract: We consider nprocessor distributed systems where the ith processor executes asynchronously the iteration xi = fi(x). It is natural to terminate the iteration of the ith processor when some local condition, such as xi fi(x): "small", holds. However, local termination co ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Abstract: We consider nprocessor distributed systems where the ith processor executes asynchronously the iteration xi = fi(x). It is natural to terminate the iteration of the ith processor when some local condition, such as xi fi(x): "small", holds. However, local termination
Line Search Algorithms With Guaranteed Sufficient Decrease
 ACM Trans. Math. Software
, 1992
"... The problem of finding a point that satisfies the sufficient decrease and curvature condition is formulated in terms of finding a point in a set T (). We describe a search algorithms for this problem that produces a sequence of iterates that converge to a point in T () and that, except for pathologi ..."
Abstract

Cited by 121 (0 self)
 Add to MetaCart
for pathological cases, terminates in a finite number of steps. Numerical results for an implementation of the search algorithm on a set of test functions show that the algorithm terminates within a small number of iterations. LINE SEARCH ALGORITHMS WITH GUARANTEED SUFFICIENT DECREASE Jorge J. Mor
Termination Conditions for Positivity Proving Procedures
, 2013
"... Proving positivity of a sequence given by a linear recurrence with polynomial coefficients (Pfinite recurrence) is a nontrivial task for both humans and computers. Algorithms dealing with this task are rare or nonexistent. One method that was introduced in the last decade by Gerhold and Kauers su ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
succeeds on many examples, but termination of this procedure has been proven so far only up to order three for special cases. Here we present an analysis that extends the previously known termination results on recurrences of order three, and also provides termination conditions for recurrences of higher
Minimizing Quadratic . . . Constraints with the Rate of Convergence and Finite Termination
, 2005
"... A new active set based algorithm is proposed that uses the conjugate gradient method to explore the face of the feasible region defined by the current iterate and the reduced gradient projection with the fixed steplength to expand the active set. The precision of approximate solutions of the auxil ..."
Abstract
 Add to MetaCart
condition number of the Hessian matrix, to prove its finite termination property even for problems whose solution does not satisfy the strict complementarity condition, and to avoid any backtracking at the cost of evaluation of an upper bound for the spectral radius of the Hessian matrix. The performance
Results 1  10
of
1,010