Sciweavers

234 search results - page 12 / 47
» Examples of Termination
Sort
View
FSTTCS
2010
Springer
14 years 12 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
OPODIS
2003
15 years 3 months ago
Detecting Locally Stable Predicates Without Modifying Application Messages
In this paper, we give an efficient algorithm to determine whether a locally stable predicate has become true in an underlying computation. Examples of locally stable predicates in...
Ranganath Atreya, Neeraj Mittal, Vijay K. Garg
ACS
2008
15 years 2 months ago
On Minimal Coalgebras
Abstract. We define an out-degree for F-coalgebras and show that the coalgebras of outdegree at most form a covariety. As a subcategory of all Fcoalgebras, this class has a termin...
H. Peter Gumm
ISSAC
2005
Springer
83views Mathematics» more  ISSAC 2005»
15 years 7 months ago
A procedure for proving special function inequalities involving a discrete parameter
We define a class of special function inequalities that contains many classical examples, such as the Cauchy-Schwarz inequality, and introduce a proving procedure based on induct...
Stefan Gerhold, Manuel Kauers
CONCUR
2003
Springer
15 years 7 months ago
Priority Rewrite Systems for OSOS Process Languages
We propose an algorithm for generating a Priority Rewrite System (PRS) for an arbitrary process language in the OSOS format such that rewriting of process terms is sound for bisim...
Irek Ulidowski