113 search results - page 14 / 23 » LTL Can Be More Succinct |
100
click to vote
CN
1998
14 years 9 months ago
1998
Internet transmission and switching facilities are partitioned into different administrative domains. To effect routing between domains, domain border routers establish pairwise p...
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
ICSE
2007
IEEE-ACM
15 years 10 months ago
2007
IEEE-ACM
The Alloy tool-set has been gaining popularity as an alternative to traditional manual testing and checking for design correctness. Alloy uses a first-order relational logic for m...
110
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
VMCAI
2010
Springer
15 years 7 months ago
2010
Springer
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition gra...