Rail Track Maintenance Planning: An Assessment Model

In Australia, railway track maintenance costs comprise between 25-35 percent of total freight train operating costs. Track maintenance planning models have been shown to reduce maintenance costs by 5 to 10 percent though improved planning. This paper describes a model which has been developed to deal with the track maintenance planning function at the medium to long-term levels. This model simulates the impacts of degrading railway track conditions and related maintenance work, in contrast to tradition models that mainly use expert systems. The model simulates the degrading track condition using an existing track degradation model. Track condition data from that model is used to determine if safety related speed restrictions are needed and what immediate maintenance work may be required for safe train operations. The model outputs the net present value of the benefits of undertaking a given maintenance strategy, when compared with a base-case scenario. The model approach has advantages over current models in investigating what if scenarios. The track engineer can assess the possible benefits in reduced operating costs from upgrading track infrastructure or from the use of improved maintenance equipment. After describing the model inputs and the assumptions used, the paper deals with the simulation of track maintenance and of train operating costs over time. The results of applying the model to a test track section using a number of different maintenance strategies are also given

Incremental bounded model checking for embedded software

Program analysis is on the brink of mainstream usage in embedded systems development. Formal verification of behavioural requirements, finding runtime errors and test case generation are some of the most common applications of automated verification tools based on bounded model checking (BMC). Existing industrial tools for embedded software use an off-the-shelf bounded model checker and apply it iteratively to verify the program with an increasing number of unwindings. This approach unnecessarily wastes time repeating work that has already been done and fails to exploit the power of incremental SAT solving. This article reports on the extension of the software model checker CBMC to support incremental BMC and its successful integration with the industrial embedded software verification tool BTC EMBEDDED TESTER. We present an extensive evaluation over large industrial embedded programs, mainly from the automotive industry. We show that incremental BMC cuts runtimes by one order of magnitude in comparison to the standard non-incremental approach, enabling the application of formal verification to large and complex embedded software. We furthermore report promising results on analysing programs with arbitrary loop structure using incremental BMC, demonstrating its applicability and potential to verify general software beyond the embedded domain

ENCOMPASS: A SAGA based environment for the compositon of programs and specifications, appendix A

ENCOMPASS is an example integrated software engineering environment being constructed by the SAGA project. ENCOMPASS supports the specification, design, construction and maintenance of efficient, validated, and verified programs in a modular programming language. The life cycle paradigm, schema of software configurations, and hierarchical library structure used by ENCOMPASS is presented. In ENCOMPASS, the software life cycle is viewed as a sequence of developments, each of which reuses components from the previous ones. Each development proceeds through the phases planning, requirements definition, validation, design, implementation, and system integration. The components in a software system are modeled as entities which have relationships between them. An entity may have different versions and different views of the same project are allowed. The simple entities supported by ENCOMPASS may be combined into modules which may be collected into projects. ENCOMPASS supports multiple programmers and projects using a hierarchical library system containing a workspace for each programmer; a project library for each project, and a global library common to all projects