Sciweavers

483 search results - page 28 / 97
» Linear Ranking with Reachability
Sort
View
CODES
2005
IEEE
14 years 2 months ago
An integer linear programming approach for identifying instruction-set extensions
This paper presents an Integer Linear Programming (ILP) approach to the instruction-set extension identification problem. An algorithm that iteratively generates and solves a set...
Kubilay Atasu, Günhan Dündar, Can C. &Ou...
JSYML
2010
55views more  JSYML 2010»
13 years 7 months ago
Groups definable in linear o-minimal structures: the non-compact case
Let M = M, +, <, 0, S be a linear o-minimal expansion of an ordered group, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is definably connected w...
Pantelis E. Eleftheriou
APPML
2004
125views more  APPML 2004»
13 years 8 months ago
A note on the controllability of higher-order linear systems
In this paper, a new condition for the controllability of higher order linear dynamical systems is obtained. The suggested test contains rank conditions of suitably defined matric...
Gregory Kalogeropoulos, Panayiotis Psarrakos
AUTOMATICA
2010
72views more  AUTOMATICA 2010»
13 years 8 months ago
Span-reachability and observability of bilinear hybrid systems
The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is...
Mihály Petreczky, Jan H. van Schuppen
APN
2004
Springer
14 years 2 months ago
LTL Model Checking for Modular Petri Nets
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
Timo Latvala, Marko Mäkelä