Sciweavers

3938 search results - page 618 / 788
» Interactive Protocols on the Reals
Sort
View
ESEC
1997
Springer
15 years 10 months ago
Verification of Liveness Properties Using Compositional Reachability Analysis
The software architecture of a distributed program can be represented by a hierarchical composition of subsystems, with interacting processes at the leaves of the hierarchy. Compo...
Shing-Chi Cheung, Dimitra Giannakopoulou, Jeff Kra...
SIGCOMM
1996
ACM
15 years 10 months ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Pawan Goyal, Harrick M. Vin, Haichen Cheng
TACS
1997
Springer
15 years 10 months ago
A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems
We present a type-based technique for the veri cation of deadlock-freedom in asynchronous concurrent systems. Our general approach is to start with a simple interaction category, i...
Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan
VLDB
1992
ACM
95views Database» more  VLDB 1992»
15 years 10 months ago
Production Rules in Parallel and Distributed Database Environments
In most database systems with production rule facilities, rules respond to operations on centralized data and rule processing is performed in a centralized, sequential fashion. In ...
Stefano Ceri, Jennifer Widom
ICASSP
2009
IEEE
15 years 10 months ago
What happens when cognitive terminals compete for a relaying node?
We introduce a new channel, which consists of an interference channel (IC) in parallel with an interference relay channel (IRC), to analyze the interaction between two selfish and...
Elena Veronica Belmega, Brice Djeumou, Samson Lasa...