395 search results - page 41 / 79 » Polynomial Approximations for Model Checking |
FMSD
2006
14 years 10 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
STOC
2002
ACM
15 years 10 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system has to establish a call between users, it may nee...
SAGT
2009
Springer
15 years 2 months ago
2009
Springer
We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann ...