Sciweavers

276 search results - page 26 / 56
» Proving Properties of Dynamic Process Networks
Sort
View
SSS
2007
Springer
15 years 3 months ago
Stabilization of Loop-Free Redundant Routing
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore...
Jorge Arturo Cobb
CSCWD
2001
Springer
15 years 2 months ago
Modeling Workflow within Distributed Systems
Workflow management techniques are aiming at supporting business process across organization boundaries. Current techniques are lacking of the formalism tools to model and analyze...
Yuhong Yan, Alex Bejan
80
Voted
DSN
2008
IEEE
15 years 4 months ago
Automatic security assessment of critical cyber-infrastructures
This research investigates the automation of security assessment of the static and dynamic properties of cyberinfrastructures, with emphasis on the electrical power grid. We descr...
Zahid Anwar, Ravinder Shankesi, Roy H. Campbell
CCS
1998
ACM
15 years 1 months ago
Authenticated Group Key Agreement and Friends
Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the op...
Giuseppe Ateniese, Michael Steiner, Gene Tsudik
113
Voted
SPAA
1994
ACM
15 years 1 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher