Sciweavers

1724 search results - page 147 / 345
» Models for Concurrency
Sort
View
135
Voted
CONCUR
2000
Springer
15 years 7 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
116
Voted
ISTA
2003
15 years 4 months ago
Formal Modeling of Communication Traces
: Development of distributed systems is complicated by the absence of reliable global timing, concurrency, and nondeterminism. To deal with these obstacles log files are produced b...
Sergiy Boroday, Hesham Hallal, Alexandre Petrenko,...
IFM
2010
Springer
147views Formal Methods» more  IFM 2010»
15 years 1 months ago
Symbolic Model-Checking of Optimistic Replication Algorithms
Abstract. The Operational Transformation (OT) approach, used in many collaborative editors, allows a group of users to concurrently update replicas of a shared object and exchange ...
Hanifa Boucheneb, Abdessamad Imine, Manal Najem
134
Voted
IOR
2010
94views more  IOR 2010»
15 years 20 days ago
Utility-Maximizing Resource Control: Diffusion Limit and Asymptotic Optimality for a Two-Bottleneck Model
We study a stochastic network that consists of two servers shared by two classes of jobs. Class 1 jobs require a concurrent occupancy of both servers while class 2 jobs use one se...
Heng-Qing Ye, David D. Yao
ICASSP
2011
IEEE
14 years 7 months ago
A methodology based on Transportation problem modeling for designing parallel interleaver architectures
For high-data-rate applications, turbo-like iterative decoders are implemented with parallel hardware architecture. However, to achieve high throughput, concurrent accesses to each...
Awais Sani, Philippe Coussy, Cyrille Chavet, Eric ...