15 search results - page 1 / 3 » Monotone AC-Tree Automata |
HYBRID
2003
Springer
13 years 10 months ago
2003
Springer
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
LFCS
2007
Springer
13 years 10 months ago
2007
Springer
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
STOC
2007
ACM
14 years 5 months ago
2007
ACM
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...