Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
The Continuation of Invariant Subspaces (CIS) algorithm produces a smoothly varying basis for an invariant subspace R(s) of a parameter-dependent matrix A(s). In the case when A(s)...
David Bindel, James Demmel, Mark J. Friedman, Will...
We consider the algebra of invariants of binary forms of degree 10 with complex coefficients, construct a system of parameters with degrees 2, 4, 6, 6, 8, 9, 10, 14 and find the ...
In this paper, a suitable LaSalle principle for continuous-time linear switched systems is used to characterize invariant sets and their associated switching laws. An algorithm to...