Formal security analysis of the DNP3-secure authentication protocol

This thesis evaluates the security of Supervisory Control and Data Acquisition (SCADA) systems, which are one of the key foundations of many critical infrastructures. Specifically, it examines one of the standardised SCADA protocols called the Distributed Network Protocol Version 3, which attempts to provide a security mechanism to ensure that messages transmitted between devices, are adequately secured from rogue applications. To achieve this, the thesis applies formal methods from theoretical computer science to formally analyse the correctness of the protocol.

Collecting data from distributed FOSS projects

A key trait of Free and Open Source Software (FOSS) development is its distributed nature. Nevertheless, two project-level operations, the fork and the merge of program code, are among the least well understood events in the lifespan of a FOSS project. Some projects have explicitly adopted these operations as the primary means of concurrent development. In this study, we examine the effect of highly distributed software development, is found in the Linux kernel project, on collection and modelling of software development data. We find that distributed development calls for sophisticated temporal modelling techniques where several versions of the source code tree can exist at once. Attention must be turned towards the methods of quality assurance and peer review that projects employ to manage these parallel source trees. Our analysis indicates that two new metrics, fork rate and merge rate, could be useful for determining the role of distributed version control systems in FOSS projects. The study presents a preliminary data set consisting of version control and mailing list data.

Collecting data from distributed FOSS projects

A key trait of Free and Open Source Software (FOSS) development is its distributed nature. Nevertheless, two project-level operations, the fork and the merge of program code, are among the least well understood events in the lifespan of a FOSS project. Some projects have explicitly adopted these operations as the primary means of concurrent development. In this study, we examine the effect of highly distributed software development, is found in the Linux kernel project, on collection and modelling of software development data. We find that distributed development calls for sophisticated temporal modelling techniques where several versions of the source code tree can exist at once. Attention must be turned towards the methods of quality assurance and peer review that projects employ to manage these parallel source trees. Our analysis indicates that two new metrics, fork rate and merge rate, could be useful for determining the role of distributed version control systems in FOSS projects. The study presents a preliminary data set consisting of version control and mailing list data.

Some new concepts in nonlinear systems

Some new concepts characterizing the response of nonlinear systems are developed. These new concepts are denoted by the terms, the transient system equivalent, the response vector, and the space-phase components. This third concept is analyzed in comparison with the well-known technique of symmetrical components. The performance of a multiplicative feedback control system is represented by a nonlinear integro-differential equation; its solution is obtained by the principle of variation of parameters. The system response is treated as a vector and is resolved into its space-phase components. The individual effects of these components on the performance of the system are discussed. The suitability of the technique for the transient analysis of higher order nonlinear control systems is discussed.

Modeling stochastic hybrid systems

Stochastic hybrid systems arise in numerous applications of systems with multiple models; e.g., air traffc management, flexible manufacturing systems, fault tolerant control systems etc. In a typical hybrid system, the state space is hybrid in the sense that some components take values in a Euclidean space, while some other components are discrete. In this paper we propose two stochastic hybrid models, both of which permit diffusion and hybrid jump. Such models are essential for studying air traffic management in a stochastic framework.

Terminal Impact Angle Constrained Guidance Laws Using Variable Structure Systems Theory

In this brief, variable structure systems theory based guidance laws, to intercept maneuvering targets at a desired impact angle, are presented. Choosing the missile's lateral acceleration (latax) to enforce sliding mode, which is the principal operating mode of variable structure systems, on a switching surface defined by the line-of-sight angle leads to a guidance law that allows the achievement of the desired terminal impact angle. As will be shown, this law does not ensure interception for all states of the missile and the target during the engagement. Hence, additional switching surfaces are designed and a switching logic is developed that allows the latax to switch between enforcing sliding mode on one of these surfaces so that the target can be intercepted at the desired impact angle. The guidance laws are designed using nonlinear engagement dynamics for the general case of a maneuvering target.

Turbine emulator for development of variable speed microhydro power generation systems

Variable speed operation of microhydro power plants is gaining popularity due to the benefits that accrue from their use and the development of suitable generator control systems. This paper highlights the benefits of variable speed systems over conventional systems and also proposes a simple emulator for hydraulic turbines that operate in variable speed fixed flow rate mode. The emulator consists of an uncontrolled separately excited DC motor with additional resistors and has performance characteristics similar to that of the hydraulic turbine.

Mining Unit Tests for Discovery and Migration of Math APIs

Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.

Sliding Mode Control-Based Autopilots for Leaderless Consensus of Unmanned Aerial Vehicles

In this brief, decentralized sliding mode controllers that enable a connected and leaderless swarm of unmanned aerial vehicles (UAVs) to reach a consensus in altitude and heading angle are presented. In addition, sliding mode control-based autopilot designs to control those states for which consensus is not required are also presented. By equipping each UAV with this combination of controllers, it can autonomously decide on being a member of the swarm or fly independently. The controllers are designed using a coupled nonlinear dynamic model, derived for the YF-22 aircraft, where the aerodynamic forces and moments are linear functions of the states and inputs.

Component-based approach to the holonic control of a robot assembly cell

The aim of this paper is to describe the implementation of a new approach for the introduction of so called 'holonic manufacturing' principles into existing production control systems. Such an approach is intended to improve the reconfigurability of the control system to cope with the increasing requirements of production change. A conceptual architecture is described and implemented in a robot assembly cell to demonstrate that this approach can lead to a manufacturing control system which can adapt relatively simply to long-term change. A design methodology and migration strategy for achieving these solutions using conventional hardware is proposed to develop execution level of manufacturing control systems.