48 search results - page 7 / 10 » Rankers over Infinite Words |
JSC
2000
14 years 11 months ago
2000
This paper presents a generalization of a theorem of Saltman on the existence of generic extensions with group A G over an infinite field K, where A is abelian, using less restri...
102
click to vote
FUIN
2010
14 years 9 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
109
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
111
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...