Results 1 - 10 of 271

Modeling and Analysis of Timed Petri Nets Using Heaps of Pieces

by Stéphane Gaubert, Jean Mairesse , 1997
"... We show that safe timed Petri nets can be represented by special automata over the (max,+) semiring, which compute the height of heaps of pieces. This extends to the timed case the classical representation a la Mazurkievicz of the behavior of safe Petri nets by trace monoids and trace languages. Fo ..."
Abstract - Cited by 56 (18 self) - Add to MetaCart
. For a subclass including all safe Free Choice Petri nets, we obtain reduced heap realizations using structural properties of the net (covering by safe state machine components). We illustrate the heap-based modeling by the typical case of safe jobshops. For a periodic schedule, we obtain a heap-based

Generalized Symbolic Execution for Model Checking and Testing

by Sarfraz Khurshid, Corina S. Pasareanu, Willem Visser , 2003
"... Modern software systems, which often are concurrent and manipulate complex data structures must be extremely reliable. We present a novel framework based on symbolic execution, for automated checking of such systems. We provide a two-fold generalization of traditional symbolic execution based ap ..."
Abstract - Cited by 232 (52 self) - Add to MetaCart
preconditions (e.g., acyclicity), data (e.g., integers and strings) and concurrency. The program instrumentation enables a model checker to automatically explore dierent program heap con gurations and manipulate logical formulae on program data (using a decision procedure). We illustrate two applications

User-Level Performance of Channel-Aware Scheduling Algorithms in Wireless Data Networks

by Sem Borst , 2003
"... Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in wireless data networks by exploiting channel fluctuations. The performance of channel-aware scheduling algorithms has mostl ..."
Abstract - Cited by 216 (9 self) - Add to MetaCart
Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in wireless data networks by exploiting channel fluctuations. The performance of channel-aware scheduling algorithms has

Constraint-based Program Reasoning with Heaps and Separation

by Gregory J. Duck, Joxan Jaffar, Nicolas C. H. Koh
"... Abstract. This paper introduces a constraint language H for finite partial maps (a.k.a. heaps) that incorporates the notion of separation from Separation Logic. We use H to build an extension of Hoare Logic for reasoning over heap manipulating programs using (constraint-based) symbolic execution. We ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
. We present a sound and complete algorithm for solving quantifier-free (QF) H-formulae based on heap element propagation. An implementation of the H-solver has been integrated into a Satisfiability Modulo Theories (SMT) framework. We experimentally evaluate the implementation against Verification

New Insights from a Fixed Point Analysis of Single Cell IEEE 802.11 WLANs

by Anurag Kumar, Eitan Altman, Daniele Miorandi, Munish Goyal , 2004
"... We study a fixed point formalisation of the well known analysis of Bianchi. We provide a significant simplication and generalisation of the analysis. In this more general framework, the fixed point solution and performance measures resulting from it are studied. Uniqueness of the fixed point is esta ..."
Abstract - Cited by 132 (25 self) - Add to MetaCart
is established. Simple and general throughput formulas are provided. It is shown that the throughput of any ow will be bounded by the one with the smallest transmission rate. The aggregate throughput is bounded by the reciprocal of the harmonic mean of the transmission rates. In an asymptotic regime with a large

On the Predictability of Large Transfer TCP Throughput

by Qi He - In Proc. of ACM SIGCOMM , 2005
"... Predicting the throughput of large TCP transfers is important for a broad class of applications. This paper focuses on the design, empirical evaluation, and analysis of TCP throughput predictors. We first classify TCP throughput prediction techniques into two categories: Formula-Based (FB) and Histo ..."
Abstract - Cited by 59 (2 self) - Add to MetaCart
Predicting the throughput of large TCP transfers is important for a broad class of applications. This paper focuses on the design, empirical evaluation, and analysis of TCP throughput predictors. We first classify TCP throughput prediction techniques into two categories: Formula-Based (FB

Theoretical Maximum Throughput of IEEE 802.11 and its Applications

by Jangeun Jun, Pushkin Peddabachagari, Mihail L. Sichitiu - In Proceedings of the IEEE International Symposium on Network Computing and Applications , 2003
"... The goal of this paper is to present exact formulae for the throughput of IEEE 802.11 networks in the absence of transmission errors and for various physical layers, data rates and packet sizes. Calculation of the throughput is more than a simple exercise. It is a mandatory part of provisioning any ..."
Abstract - Cited by 70 (4 self) - Add to MetaCart
The goal of this paper is to present exact formulae for the throughput of IEEE 802.11 networks in the absence of transmission errors and for various physical layers, data rates and packet sizes. Calculation of the throughput is more than a simple exercise. It is a mandatory part of provisioning any

Modeling the Throughput of TCP Vegas

by Charalampos Babis Samios, Mary K. Vernon - In Proc. of ACM Sigmetrics , 2003
"... Previous analytic models of TCP Vegas throughput have been developed for loss-free (all-Vegas) networks. This work develops a simple and accurate analytic model for the throughput of a TCP Vegas bulk transfer in the presence of packet loss, as a function of average round trip time, minimum round tri ..."
Abstract - Cited by 20 (1 self) - Add to MetaCart
, congestion avoidance, and congestion recovery. The results include (1) a simple, validated model of TCP Vegas throughput that can be used for equation-based rate control of other flows such as UDP streams, (2) a simple formula to determine, from the measured packet loss rate, whether the network buffers

Parallel tcp sockets: Simple model, throughput and validation

by Eitan Altman, Dhiman Barman, Bruno Tuffin, Milan Vojnović , 2005
"... We found a formula for aggregate throughput of arbitrarily given number of competing additive-increase, multiplicative-decrease connections (TCP congestion avoidance mode) for a bottleneck, under assumption that loss events over connections are non synchronized. The formula captures throughput-def ..."
Abstract - Cited by 36 (3 self) - Add to MetaCart
We found a formula for aggregate throughput of arbitrarily given number of competing additive-increase, multiplicative-decrease connections (TCP congestion avoidance mode) for a bottleneck, under assumption that loss events over connections are non synchronized. The formula captures throughput

AN ANALYTICAL FORMULA FOR THROUGHPUT OF A PRODUCTION LINE WITH IDENTICAL STATIONS AND RANDOM FAILURES

by Dennis E. Blumenfeld, Jingshan Li , 2004
"... We derive a simple formula for the throughput (jobs produced per unit time) of a serial production line with workstations that are subject to random failures. The derivation is based on equations developed for a line flow model that takes into account the impact of finite buffers between workstation ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We derive a simple formula for the throughput (jobs produced per unit time) of a serial production line with workstations that are subject to random failures. The derivation is based on equations developed for a line flow model that takes into account the impact of finite buffers between
Results 1 - 10 of 271