5084 search results - page 258 / 1017 » Proving Possibility Properties |
145
click to vote
TACAS
2007
Springer
16 years 21 days ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
167
click to vote
ACSD
2008
IEEE
15 years 8 months ago
2008
IEEE
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
176
click to vote
DEDS
2007
15 years 6 months ago
2007
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offlin...
156
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
143
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
This paper presents a new method for computing optimal L1
solutions for vision geometry problems, particularly for those
problems of fixed-dimension and of large-scale. Our strat...