1894 search results - page 308 / 379 » A TLA Proof System |
117
Voted
AUTOMATICA
2008
15 years 3 months ago
2008
This paper presents Lyapunov functions for proving stability of steady gliding motions for vehicles with hydrodynamic or aerodynamic forces and moments. Because of lifting forces ...
148
Voted
AUTOMATICA
2007
15 years 3 months ago
2007
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
138
Voted
CORR
2008
Springer
15 years 3 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...
134
Voted
ENTCS
2008
15 years 3 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
145
click to vote
FUIN
2008
15 years 3 months ago
2008
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...