1716 search results - page 45 / 344 » Proving Conditional Termination |
INFOCOM
1992
IEEE
14 years 23 days ago
1992
IEEE
In order to take advantage of the low entry cost of the future public ATM (asynchronous transfer mode) network with shared facilities, it is highly desirable to interconnect diffe...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.
AML
2005
13 years 8 months ago
2005
We apply Mints' technique for proving the termination of the epsilon substitution method via cut-elimination to the system of Peano Arithmetic with Transfinite Induction give...
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
JCT
2002
13 years 8 months ago
2002
Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung a...