Sciweavers

1000 search results - page 25 / 200
» Nominal rewriting systems
Sort
View
AUTOMATICA
2010
96views more  AUTOMATICA 2010»
13 years 7 months ago
On resampling and uncertainty estimation in Linear System Identification
Linear System Identification yields a nominal model parameter, which minimizes a specific criterion based on the single inputoutput data set. Here we investigate the utility of va...
Simone Garatti, Robert R. Bitmead
CCE
2008
13 years 7 months ago
Safe-parking of nonlinear process systems
This work considers the problem of control of nonlinear process systems subject to input constraints and actuator faults. Faults are considered that preclude the possibility of con...
Rahul Gandhi, Prashant Mhaskar
AGTIVE
2003
Springer
14 years 23 days ago
Integrating Graph Rewriting and Standard Software Tools
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
Uwe Aßmann, Johan Lövdahl
CC
2001
Springer
177views System Software» more  CC 2001»
14 years 1 days ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
ACTA
2005
101views more  ACTA 2005»
13 years 7 months ago
A general framework for types in graph rewriting
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Barbara König