Sciweavers

376 search results - page 8 / 76
» Self-Stabilizing Graph Protocols
Sort
View
WCRE
2007
IEEE
14 years 1 months ago
Dynamic Protocol Recovery
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
Jochen Quante, Rainer Koschke
FM
2003
Springer
115views Formal Methods» more  FM 2003»
14 years 25 days ago
SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis
Alessandro Armando, Luca Compagna, Pierre Ganty
ERCIMDL
2006
Springer
140views Education» more  ERCIMDL 2006»
13 years 11 months ago
A Semantics-Based Graph for the Bib-1 Access Points of the Z39.50 Protocol
ined abstract Access Points combined with specific attributes (Attribute Sets)
Michalis Sfakakis, Sarantos Kapidakis
FSTTCS
1994
Springer
13 years 11 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 6 months ago
Designing Network Protocols for Good Equilibria
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol t...
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant