449 search results - page 69 / 90 » Formal Modeling of Communication Protocols by Graph Transfor... |
ENTCS
2006
14 years 11 months ago
2006
We deal with temporal aspects of distributed systems, introducing and studying a new model called timed distributed -calculus. This model extends distributed -calculus with timers...
101
click to vote
MOBIHOC
2006
ACM
15 years 11 months ago
2006
ACM
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
117
click to vote
TPDS
2008
14 years 11 months ago
2008
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
118
click to vote
SIGSOFT
2003
ACM
16 years 12 days ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
111
click to vote
TACAS
2010
Springer
14 years 9 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...