Construction timbers in Queensland. Book 1 and Book 2: Properties and specifications for satisfactory performance of construction timbers in Queensland. Class 1 and Class 10 buildings (houses, carports, garages, greenhouses and sheds). 2013 edition.

This publication lists the more important wood properties of commercial timbers used for construction in Queensland. It also provides requirements and conditions of use for these timbers to provide appropriate design service life in various construction applications. The correct specification of timber considers a range of timber properties including, but not limited to, stress grade; durability class; moisture content and insect resistance. For the specification of timber sizes and spans, relevant Australian Standards and design manuals should be consulted—e.g. Australian Standard AS 1684 series Residential timber—framed construction parts 2 and 3 (Standards Australia 2006a;b.) Book 1 explains the terms used; with reference to nomenclature; origin and timber properties presented under specific column headings in the schedules (Book 2). It also explains target design life; applications and decay hazard zones; presented in the Book 2 Schedules. Book 2 consists of reference tables; presented as schedules A; B and C: • Schedule A contains commercial mixtures of unidentified timbers and of some Australian and imported softwoods. Index numbers 1–10 • Schedule B contains Australian-grown timber species; including both natural forests and plantations. Index numbers 11–493 • Schedule C contains timbers imported into Australia from overseas. Index numbers 494–606 Each schedule has two parts presenting data in tables. • Part 1: Nomenclature, origin and properties of imported timber species • Part 2: Approved uses for commercial mixtures of imported timber species The recommendations made in this publication assume that good building practice will be carried out.

Plantation hardwood resource specifications required for planning small log sawing infrastructure investment in Queensland.

Improved information on the product quality of the plantation resource is needed to allow businesses to consider investing in the development of value-adding processing facilities. These facilities are likely to require customised design that optimises the utilisation of future small diameter plantation hardwood logs. This log resource will become available as wood supply in Queensland transitions from native forests to 100% from sustainable plantations. This resource will be controlled by plantations established prior to 2000. A survey of the three main growers (former Forest Enterprises Australia Pty Ltd, former Forestry Corporation of New South Wales, Hancock Queensland Plantation Pty Ltd) revealed that C. citriodora subsp.variegata – CCV (28.0%), Eucalyptus dunnii (27.5%), E. pilularis (23.0%), E. grandis (11.3%) and E. cloeziana –GMS (7.1%) were the most widely planted species in the southern Queensland and northern New South Wales subtropical hardwood estate and would potentially dominate the supply of plantation hardwoods to sawmill processing facilities.

Automatic verification of distributed logic specifications

Formal specification is vital to the development of distributed real-time systems as these systems are inherently complex and safety-critical. It is widely acknowledged that formal specification and automatic analysis of specifications can significantly increase system reliability. Although a number of specification techniques for real-time systems have been reported in the literature, most of these formalisms do not adequately address to the constraints that the aspects of 'distribution' and 'real-time' impose on specifications. Further, an automatic verification tool is necessary to reduce human errors in the reasoning process. In this regard, this paper is an attempt towards the development of a novel executable specification language for distributed real-time systems. First, we give a precise characterization of the syntax and semantics of DL. Subsequently, we discuss the problems of model checking, automatic verification of satisfiability of DL specifications, and testing conformance of event traces with DL specifications. Effective solutions to these problems are presented as extensions to the classical first-order tableau algorithm. The use of the proposed framework is illustrated by specifying a sample problem.

Conflict-Tolerant Real-Time Specifications in Metric Temporal Logic

A framework based on the notion of "conflict-tolerance" was proposed in as a compositional methodology for developing and reasoning about systems that comprise multiple independent controllers. A central notion in this framework is that of a "conflict-tolerant" specification for a controller. In this work we propose a way of defining conflict-tolerant real-time specifications in Metric Interval Temporal Logic (MITL). We call our logic CT-MITL for Conflict-Tolerant MITL. We then give a clock optimal "delay-then-extend" construction for building a timed transition system for monitoring past-MITL formulas. We show how this monitoring transition system can be used to solve the associated verification and synthesis problems for CT-MITL.

Analysing Message Sequence Graph Specifications

We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is well-known in the literature and forms the basis for the solution to several analysis and verification problems concerning MSG specifications, the constructions given in the literature are either not amenable to implementation, or imprecise, or simply incorrect. In contrast we give a detailed construction along with a proof of its correctness. Our transition system is amenable to implementation, and can also be used for a bounded analysis of general (not necessarily com-connected) MSG specifications.

Conflict-tolerant specifications for hybrid systems

We propose a framework for developing and reasoning about hybrid systems that are comprised of a plant with multiple controllers, each of which controls the plant intermittently. The framework is based on the notion of a ``conflict tolerant'' specification for a controller, and provides a modular way of developing and reasoning about such systems. We propose a novel mechanism of defining conflict-tolerant specifications for general hybrid systems, using ``acceptor'' and ``advisor'' components. We also give a decision procedure for verifying whether a controller satisfies its conflict-tolerant specification, in the special case when the components are modeled using initialized rectangular hybrid automata.

Design of fully rotatable, roller-crank-driven, cam mechanisms for arbitrary motion specifications

The design of a non-traditional cam and roller-follower mechanism is described here. In this mechanism, the roller-crank rather than the cam is used as the continuous input member, while both complete a full rotation in each revolution and remain in contact throughout. It is noted that in order to have the cam fully rotate for every full rotation of the roller-crank, the cam cannot be a closed profile, rather the roller traverses the open cam profile twice in each cycle. Using kinematic analysis, the angular velocity of the cam when the roller traverses the cam profile in one direction, is related to the angular velocity of the cam when the roller retraces its path on the cam in the other direction. Thus, one can specify any arbitrary function relating the motion of the cam to the motion of the roller-crank for only 180 degrees of rotation in the angular velocity space. The motion of the cam in the remaining portion is then automatically determined. In specifying the arbitrary motion, many desirable characteristics such as multiple dwells, low acceleration and jerk, etc., can be obtained. Useful design equations are derived for this purpose. Using the kinematic inversion technique, the cam profile is readily obtained once the motion is specified in the angular velocity space. The only limitation to the arbitrary motion specification is making sure that the transmission angle never gets too low, so that the force will be transmitted efficiently from roller to cam. This is addressed by incorporating a transmission index into the motion specification in the synthesis process. Consequently, in this method we can specify any arbitrary motion within a permissible rone, such that the transmission index is higher than the specified minimum value. Single-dwell, double-dwell and a long hesitation motion are used as examples to demonstrate the ffectiveness of the design method. Force closure using an optimally located spring and quasi-kinetostatic analysis are also discussed. (C) 2001 Elsevier Science Ltd. All rights reserved.

Control of dynamical systems with temporal logic specifications

This thesis is motivated by safety-critical applications involving autonomous air, ground, and space vehicles carrying out complex tasks in uncertain and adversarial environments. We use temporal logic as a language to formally specify complex tasks and system properties. Temporal logic specifications generalize the classical notions of stability and reachability that are studied in the control and hybrid systems communities. Given a system model and a formal task specification, the goal is to automatically synthesize a control policy for the system that ensures that the system satisfies the specification. This thesis presents novel control policy synthesis algorithms for optimal and robust control of dynamical systems with temporal logic specifications. Furthermore, it introduces algorithms that are efficient and extend to high-dimensional dynamical systems.

The first contribution of this thesis is the generalization of a classical linear temporal logic (LTL) control synthesis approach to optimal and robust control. We show how we can extend automata-based synthesis techniques for discrete abstractions of dynamical systems to create optimal and robust controllers that are guaranteed to satisfy an LTL specification. Such optimal and robust controllers can be computed at little extra computational cost compared to computing a feasible controller.

The second contribution of this thesis addresses the scalability of control synthesis with LTL specifications. A major limitation of the standard automaton-based approach for control with LTL specifications is that the automaton might be doubly-exponential in the size of the LTL specification. We introduce a fragment of LTL for which one can compute feasible control policies in time polynomial in the size of the system and specification. Additionally, we show how to compute optimal control policies for a variety of cost functions, and identify interesting cases when this can be done in polynomial time. These techniques are particularly relevant for online control, as one can guarantee that a feasible solution can be found quickly, and then iteratively improve on the quality as time permits.

The final contribution of this thesis is a set of algorithms for computing feasible trajectories for high-dimensional, nonlinear systems with LTL specifications. These algorithms avoid a potentially computationally-expensive process of computing a discrete abstraction, and instead compute directly on the system's continuous state space. The first method uses an automaton representing the specification to directly encode a series of constrained-reachability subproblems, which can be solved in a modular fashion by using standard techniques. The second method encodes an LTL formula as mixed-integer linear programming constraints on the dynamical system. We demonstrate these approaches with numerical experiments on temporal logic motion planning problems with high-dimensional (10+ states) continuous systems.

Incremental Control Synthesis for Robotics in the Presence of Temporal Logic Specifications

This thesis presents methods for incrementally constructing controllers in the presence of uncertainty and nonlinear dynamics. The basic setting is motion planning subject to temporal logic specifications. Broadly, two categories of problems are treated. The first is reactive formal synthesis when so-called discrete abstractions are available. The fragment of linear-time temporal logic (LTL) known as GR(1) is used to express assumptions about an adversarial environment and requirements of the controller. Two problems of changes to a specification are posed that concern the two major aspects of GR(1): safety and liveness. Algorithms providing incremental updates to strategies are presented as solutions. In support of these, an annotation of strategies is developed that facilitates repeated modifications. A variety of properties are proven about it, including necessity of existence and sufficiency for a strategy to be winning. The second category of problems considered is non-reactive (open-loop) synthesis in the absence of a discrete abstraction. Instead, the presented stochastic optimization methods directly construct a control input sequence that achieves low cost and satisfies a LTL formula. Several relaxations are considered as heuristics to address the rarity of sampling trajectories that satisfy an LTL formula and demonstrated to improve convergence rates for Dubins car and single-integrators subject to a recurrence task.