Increasing Distributed Generation Penetration using Soft Normally-Open Points

This paper considers the effects of various voltage control solutions on facilitating an increase in allowable levels of distributed generation installation before voltage violations occur. In particular, the voltage control solution that is focused on is the implementation of `soft' normally-open points (SNOPs), a term which refers to power electronic devices installed in place of a normally-open point in a medium-voltage distribution network which allows for control of real and reactive power flows between each end point of its installation sites. While other benefits of SNOP installation are discussed, the intent of this paper is to determine whether SNOPs are a viable alternative to other voltage control strategies for this particular application. As such, the SNOPs ability to affect the voltage profile along feeders within a distribution system is focused on with other voltage control options used for comparative purposes. Results from studies on multiple network models with varying topologies are presented and a case study which considers economic benefits of increasing feasible DG penetration is also given

Passivity Enforcement via Perturbation of Hamiltonian Matrices

This paper presents a new technique for the passivity enforcement of linear time-invariant multiport systems in statespace form. This technique is based on a study of the spectral properties of related Hamiltonian matrices. The formulation is applicable in case the system input-output transfer function is in admittance, impedance, hybrid, or scattering form. A standard test for passivity is first performed by checking the existence of imaginary eigenvalues of the associated Hamiltonian matrix. In the presence of imaginary eigenvalues the system is not passive. In such a case, a new result based on first-order perturbation theory is presented for the precise characterization of the frequency bands where passivity violations occur. This characterization is then used for the design of an iterative perturbation scheme of the state matrices, aimed at the displacement of the imaginary eigenvalues of the Hamiltonian matrix. The result is an effective algorithm leading to the compensation of the passivity violations. This procedure is very efficient when the passivity violations are small, so that first-order perturbation is applicable. Several examples illustrate and validate the procedure

Compensator improvement for multivariable control systems

A theory and the associated numerical technique are developed for an iterative design improvement of the compensation for linear, time-invariant control systems with multiple inputs and multiple outputs. A strict constraint algorithm is used in obtaining a solution of the specified constraints of the control design. The result of the research effort is the multiple input, multiple output Compensator Improvement Program (CIP). The objective of the Compensator Improvement Program is to modify in an iterative manner the free parameters of the dynamic compensation matrix so that the system satisfies frequency domain specifications. In this exposition, the underlying principles of the multivariable CIP algorithm are presented and the practical utility of the program is illustrated with space vehicle related examples

Context constraint integration and validation in dynamic web service compositions

System architectures that cross organisational boundaries are usually implemented based on Web service technologies due to their inherent interoperability benets. With increasing exibility requirements, such as on-demand service provision, a dynamic approach to service architecture focussing on composition at runtime is needed. The possibility of technical faults, but also violations of functional and semantic constraints require a comprehensive notion of context that captures composition-relevant aspects. Context-aware techniques are consequently required to support constraint validation for dynamic service composition. We present techniques to respond to problems occurring during the execution of dynamically composed Web services implemented in WS-BPEL. A notion of context { covering physical and contractual faults and violations { is used to safeguard composed service executions dynamically. Our aim is to present an architectural framework from an application-oriented perspective, addressing practical considerations of a technical framework

LTLf and LDLf Monitoring: A Technical Report

Runtime monitoring is one of the central tasks to provide operational decision support to running business processes, and check on-the-fly whether they comply with constraints and rules. We study runtime monitoring of properties expressed in LTL on finite traces (LTLf) and in its extension LDLf. LDLf is a powerful logic that captures all monadic second order logic on finite traces, which is obtained by combining regular expressions and LTLf, adopting the syntax of propositional dynamic logic (PDL). Interestingly, in spite of its greater expressivity, LDLf has exactly the same computational complexity of LTLf. We show that LDLf is able to capture, in the logic itself, not only the constraints to be monitored, but also the de-facto standard RV-LTL monitors. This makes it possible to declaratively capture monitoring metaconstraints, and check them by relying on usual logical services instead of ad-hoc algorithms. This, in turn, enables to flexibly monitor constraints depending on the monitoring state of other constraints, e.g., "compensation" constraints that are only checked when others are detected to be violated. In addition, we devise a direct translation of LDLf formulas into nondeterministic automata, avoiding to detour to Buechi automata or alternating automata, and we use it to implement a monitoring plug-in for the PROM suite