Optimum coal properties and engineering processes for CO2 geosequestration in Coal

CO2 Geosequestration is seen by many worldwide scientists and engineers as a leading prospective solution to the global warming problem arising from excessive CO2 and other greenhouse gas emissions. CO2 geosequestration in coal seams has two important strategic benefits: the process has an extremely low risk of leakage, due to the adsorbed state of the CO2 and the known reservoir context of essentially-zero leakage into which it is be injected; the second benefit arises from the valuable by-product, clean burning coalbed methane gas. This paper presents the authors’ experience, knowledge and perspective on what coal properties and engineering processes would favour implementing a demonstration or commercial CO2 storage-in-coal project, in Queensland, Australia. As such, it may be considered a template for screening studies to select the optimum coal seam reservoir, and for preliminary studies in designing the injection system and predicting production response to the technology. The paper concludes by examining the current knowledge gaps of CO2 geosequestration in coal, identifying further basic and applied research topics.

Termination of real-time programs: Definitely, definitely not, or maybe

Real-time control programs are often used in contexts where (conceptually) they run forever. Repetitions within such programs (or their specifications) may either (i) be guaranteed to terminate, (ii) be guaranteed to never terminate (loop forever), or (iii) may possibly terminate. In dealing with real-time programs and their specifications, we need to be able to represent these possibilities, and define suitable refinement orderings. A refinement ordering based on Dijkstra's weakest precondition only copes with the first alternative. Weakest liberal preconditions allow one to constrain behaviour provided the program terminates, which copes with the third alternative to some extent. However, neither of these handles the case when a program does not terminate. To handle this case a refinement ordering based on relational semantics can be used. In this paper we explore these issues and the definition of loops for real-time programs as well as corresponding refinement laws.

Computer-aided programming using formally specificed design templates

This paper describes a formal component language, used to support automated component-based program development. The components, referred to as templates, are machine processable, meaning that appropriate tool support, such as retrieval support, can be developed. The templates are highly adaptable, meaning that they can be applied to a wide range of problems. Some of the main features of the language are described, including: higher-order parameters; state variable declarations; specification statements and conditionals; applicability conditions and theories; meta-level place holders; and abstract data structures.