413 search results - page 39 / 83 » Synthesis of Distributed Algorithms Using Asynchronous Autom... |
196
click to vote
CONCUR
1997
Springer
15 years 10 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
167
click to vote
IPPS
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we propose, implement and analyze the performance of a Reconfigurable Sequential Consistency Algorithm (RSCA) using simulation. Extending the concepts of reconfigur...
163
click to vote
ASMTA
2008
Springer
15 years 8 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
157
click to vote
FSMNLP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
169
click to vote
PDP
2005
IEEE
15 years 11 months ago
2005
IEEE
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...