449 search results - page 63 / 90 » Formal Modeling of Communication Protocols by Graph Transfor... |
115
click to vote
SAS
2001
Springer
15 years 8 months ago
2001
Springer
Model checking would answer all finite-state verification problems, if it were not for the notorious state-space explosion problem. A problem of practical importance, which attra...
155
Voted
ICC
2008
IEEE
15 years 10 months ago
2008
IEEE
CALLAWAY, ROBERT DAVID. An Autonomic Service Delivery Platform for Service-Oriented Network Environments. (Under the direction of Michael Devetsikiotis and Yannis Viniotis.) Servi...
131
Voted
ESSLLI
1999
Springer
15 years 7 months ago
1999
Springer
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
128
Voted
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
142
Voted
CCS
2007
ACM
15 years 9 months ago
2007
ACM
In measuring the overall security of a network, a crucial issue is to correctly compose the measure of individual components. Incorrect compositions may lead to misleading results...