717 search results - page 48 / 144 » Kill-safe synchronization abstractions |
PTS
2007
14 years 12 days ago
2007
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
ICGI
2010
Springer
14 years 2 days ago
2010
Springer
Abstract. In this article, we propose the use of suffix arrays to efficiently implement n-gram language models with practically unlimited size n. This approach, which is used with ...
DC
2010
13 years 11 months ago
2010
d Abstract) Marcos K. Aguilera1 , Eli Gafni1,2 , and Leslie Lamport1 1 Microsoft Research Silicon Valley 2 UCLA We propose and solve a synchronization problem called the mailbox pr...
ENTCS
2006
13 years 11 months ago
2006
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
ICALP
1989
Springer
14 years 3 months ago
1989
Springer
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...