Control dependences characterize how the predicates in a program govern the execution of other statements and predicates. Control dependences are defined in terms of a program’s control-flow graph; given a control-flow graph G, a corresponding control dependence graph, CDG(G), can be constructed. This paper addresses the inverse problem: we define an algorithm that, given a control dependence g...

This paper is concerned with the pouring control of tilting-ladle-type automatic pouring systems in casting industries. A new approach to the modeling and control system of the pouring process is proposed. In the approach, the flow rate model is described by a nonlinear system with hydrodynamics. The flow rate control system is built by a feedfoward control using the inverse dynamics of the flo...

We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...

In this paper, a robust local controller has been designed to balance the power for distributed energy resources (DERs) in an islanded microgrid. Three different DER types are considered in this study; photovoltaic systems, battery energy storage systems, and synchronous generators. Since DER dynamics are nonlinear and uncertain, which may destabilize the power system or decrease the performanc...

This paper argues that Haigh and Young’s definition of noninterference for intransitive security policies admits information flows that are not in accordance with the intuitions it seeks to formalise. Several alternative definitions are discussed, which are shown to be equivalent to the classical definition of noninterference with respect to transitive policies. Rushby’s unwinding conditions fo...

We consider a grid network where nodes contain small buffers. A packet that faces a crowded buffer in its route will get extra latency and may be dropped. In this paper, we propose a novel flow control protocol called RFCC for grid networks. RFCC tries to reroute delayed packets and utilizes network coding to introduce a configurable amount of redundant information in the network, thereby incre...