787 search results - page 12 / 158 » Polynomial Constants are Decidable |
JAR
2006
13 years 8 months ago
2006
We use some recent techniques from process algebra to draw several conclusions about the well studied class of ping-pong protocols introduced by Dolev and Yao. In particular we sho...
SAGT
2009
Springer
14 years 15 days 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 ...
HYBRID
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
FTP
1998
Springer
14 years 5 days ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
This paper investigates the properties of Metric Temporal Logic (MTL) over models in which time is dense but phenomena are constrained to have bounded variability. Contrary to the ...