1894 search results - page 187 / 379 » A TLA Proof System |
192
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
139
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. Operating-system verification gains increasing research interest. The complexity of such systems is, however, challenging and many endeavors are limited in some respect: ...
215
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
142
click to vote
IEEEARES
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we show that it is possible to implement a perfect failure detector P (one that detects all faulty processes if and only if those processes failed) in a non-synchr...
167
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
The behaviours of autonomous agents may deviate from those deemed to be for the good of the societal systems of which they are a part. Norms have therefore been proposed as a mean...