Tool support for planning the restructuring of data abstractions in large systems

1998 ◽  
Vol 24 (7) ◽  
pp. 534-558 ◽  
Author(s):  
W.G. Griswold ◽  
M.I. Chen ◽  
R.W. Bowdidge ◽  
J.L. Cabaniss ◽  
V.B. Nguyen ◽  
...  
Keyword(s):  
Tool Support ◽  
Large Systems

Tool support for planning the restructuring of data abstractions in large systems

1996 ◽  
Vol 21 (6) ◽  
pp. 33-45 ◽  
Author(s):  
William G. Griswold ◽  
Morison I. Chen ◽  
Robert W. Bowdidge ◽  
J. David Morgenthaler
Keyword(s):  
Tool Support ◽  
Large Systems

scholarly journals Delay-Dependent Robust Stabilization for Nonlinear Large Systems via Decentralized Fuzzy Control

2011 ◽  
Vol 2011 ◽  
pp. 1-20 ◽  
Author(s):  
Chun-xia Dou ◽  
Zhi-sheng Duan ◽  
Xing-bei Jia ◽  
Xiao-gang Li ◽  
Jin-zhao Yang ◽  
...  
Keyword(s):  
Time Delay ◽  
Fuzzy Control ◽  
Upper Bound ◽  
Time Delays ◽  
Sufficient Conditions ◽  
Large System ◽  
Disturbance Attenuation ◽  
Robust Controller ◽  
Large Systems ◽  
Delay Dependent

A delay-dependent robust fuzzy control approach is developed for a class of nonlinear uncertain interconnected time delay large systems in this paper. First, an equivalent T–S fuzzy model is extended in order to accurately represent nonlinear dynamics of the large system. Then, a decentralized state feedback robust controller is proposed to guarantee system stabilization with a prescribedH∞disturbance attenuation level. Furthermore, taking into account the time delays in large system, based on a less conservative delay-dependent Lyapunov function approach combining with linear matrix inequalities (LMI) technique, some sufficient conditions for the existence ofH∞robust controller are presented in terms of LMI dependent on the upper bound of time delays. The upper bound of time-delay and minimizedH∞performance index can be obtained by using convex optimization such that the system can be stabilized and for all time delays whose sizes are not larger than the bound. Finally, the effectiveness of the proposed controller is demonstrated through simulation example.

scholarly journals Reasoning with the HERMIT: tool support for equational reasoning on GHC core programs

2016 ◽  
Vol 50 (12) ◽  
pp. 23-34 ◽  
Author(s):  
Andrew Farmer ◽  
Neil Sculthorpe ◽  
Andy Gill
Keyword(s):  
Tool Support ◽  
Equational Reasoning

scholarly journals Monitoring and Control of Large Systems with MonALISA

Queue ◽  
2009 ◽  
Vol 7 (6) ◽  
pp. 40-49
Author(s):  
Iosif Legrand ◽  
Ramiro Voicu ◽  
Catalin Cirstoiu ◽  
Costin Grigoras ◽  
Latchezar Betev ◽  
...  
Keyword(s):  
Monitoring And Control ◽  
Large Systems ◽  
And Control

scholarly journals On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems

Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 465
Author(s):  
Agnieszka Prusińska ◽  
Krzysztof Szkatuła ◽  
Alexey Tret’yakov
Keyword(s):  
Computational Complexity ◽  
Polynomial Complexity ◽  
Initial Point ◽  
Quadratic Functions ◽  
Problem Dimension ◽  
Piecewise Quadratic Functions ◽  
Large Systems ◽  
Systems Of Linear Inequalities ◽  
Number Of Iterations ◽  
Finite Number Of Iterations

This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of the problem dimension, i.e., if the initial point belongs to the sufficiently small neighbourhood of the solution set. Proposed method could be applied for solving large systems of linear inequalities.

scholarly journals Correct program parallelisations

2021 ◽  
Author(s):  
S. Blom ◽  
S. Darabi ◽  
M. Huisman ◽  
M. Safari
Keyword(s):  
Composition Operators ◽  
Parallel Programs ◽  
Parallel Program ◽  
Tool Support ◽  
Intermediate Representation ◽  
Data Race ◽  
Sequential Program ◽  
Functional Correctness ◽  
Correct Program ◽  
Basic Blocks

AbstractA commonly used approach to develop deterministic parallel programs is to augment a sequential program with compiler directives that indicate which program blocks may potentially be executed in parallel. This paper develops a verification technique to reason about such compiler directives, in particular to show that they do not change the behaviour of the program. Moreover, the verification technique is tool-supported and can be combined with proving functional correctness of the program. To develop our verification technique, we propose a simple intermediate representation (syntax and semantics) that captures the main forms of deterministic parallel programs. This language distinguishes three kinds of basic blocks: parallel, vectorised and sequential blocks, which can be composed using three different composition operators: sequential, parallel and fusion composition. We show how a widely used subset of OpenMP can be encoded into this intermediate representation. Our verification technique builds on the notion of iteration contract to specify the behaviour of basic blocks; we show that if iteration contracts are manually specified for single blocks, then that is sufficient to automatically reason about data race freedom of the composed program. Moreover, we also show that it is sufficient to establish functional correctness on a linearised version of the original program to conclude functional correctness of the parallel program. Finally, we exemplify our approach on an example OpenMP program, and we discuss how tool support is provided.

Sign in / Sign up

Export Citation Format

Share Document