Structuring real-time Object-Z specifications

This paper presents a means of structuring specifications in real-time Object-Z: an integration of Object-Z with the timed refinement calculus. Incremental modification of classes using inheritance and composition of classes to form multi-component systems are examined. Two approaches to the latter are considered: using Object-Z's notion of object instantiation and introducing a parallel composition operator similar to those found in process algebras. The parallel composition operator approach is both more concise and allows more general modelling of concurrency. Its incorporation into the existing semantics of real-time Object-Z is presented.

An agent-based approach to modelling driver route choice behaviour under the influence of real-time information

This paper presents an agent-based approach to modelling individual driver behaviour under the influence of real-time traffic information. The driver behaviour models developed in this study are based on a behavioural survey of drivers which was conducted on a congested commuting corridor in Brisbane, Australia. Commuters' responses to travel information were analysed and a number of discrete choice models were developed to determine the factors influencing drivers' behaviour and their propensity to change route and adjust travel patterns. Based on the results obtained from the behavioural survey, the agent behaviour parameters which define driver characteristics, knowledge and preferences were identified and their values determined. A case study implementing a simple agent-based route choice decision model within a microscopic traffic simulation tool is also presented. Driver-vehicle units (DVUs) were modelled as autonomous software components that can each be assigned a set of goals to achieve and a database of knowledge comprising certain beliefs, intentions and preferences concerning the driving task. Each DVU provided route choice decision-making capabilities, based on perception of its environment, that were similar to the described intentions of the driver it represented. The case study clearly demonstrated the feasibility of the approach and the potential to develop more complex driver behavioural dynamics based on the belief-desire-intention agent architecture. (C) 2002 Elsevier Science Ltd. All rights reserved.

Differentiation of peanut seedborne potyviruses and curcumoviruses by RT-PCR

Seedborne peanut viruses pose important constraints to peanut production and safe movement of germ plasm. They also pose a risk of accidental introduction into previously disease-free regions. We have developed reverse transcription-polymerase chain reaction (RT-PCR) assays based on identical cycling parameters which identified peanut stripe, Peanut mottle, Peanut stunt, and Cucumber mosaic viruses through production of specific DNA fragments of 234 bp, 327 bp, 390 bp, and 133 bp, respectively. Assay sensitivity in the picogram range was achieved. The two potyviruses and two cucumoviruses could be differentiated using duplex RT-PCR assays. These assays should be useful for testing peanut leaves or seeds for virus identification in epidemiological studies, seed testing or in post-entry quarantine.

Reasoning about real-time repetitions: terminating and nonterminating

It is common for a real-time system to contain a nonterminating process monitoring an input and controlling an output. Hence, a real-time program development method needs to support nonterminating repetitions. In this paper we develop a general proof rule for reasoning about possibly nonterminating repetitions. The rule makes use of a Floyd-Hoare-style loop invariant that is maintained by each iteration of the repetition, a Jones-style relation between the pre- and post-states on each iteration, and a deadline specifying an upper bound on the starting time of each iteration. The general rule is proved correct with respect to a predicative semantics. In the case of a terminating repetition the rule reduces to the standard rule extended to handle real time. Other special cases include repetitions whose bodies are guaranteed to terminate, nonterminating repetitions with the constant true as a guard, and repetitions whose termination is guaranteed by the inclusion of a fixed deadline. (C) 2002 Elsevier Science B.V. All rights reserved.

A formal model of real-time program compilation

Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from high-level language programs to assembler code, Recent models also incorporate timing properties, but the resulting formalisms are intimidatingly complex. Here we take advantage of a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real-time constraints. (C) 2002 Elsevier Science B.V. All rights reserved.

Quantitation of alternatively spliced NMDA receptor NR1 isoform mRNA transcripts in human brain by competitive RT-PCR

The N-methyl-D-aspartate (NMDA)-selective subtype of ionotropic glutamate receptor is of importance in neuronal differentiation and synapse consolidation, activity-dependent forms of synaptic plasticity, and excitatory amino acid-mediated neuronal toxicity [Neurosci. Res. Program, Bull. 19 (1981) 1; Lab. Invest. 68 (1993) 372]. NMDA receptors exist in vivo as tetrameric or pentameric complexes comprising proteins from two families of homologous subunits, designated NR1 and NR2(A-D) [Biochem. Biophys. Res. Commun. 185 (1992) 826]. The gene coding for the human NR1 subunit (hNR1) is composed of 21 exons, three of which (4, 20 and 21) can be differentially spliced to generate a total of eight distinct subunit variants. We detail here a competitive RT-PCR (cRT-PCR) protocol to quantify endogenous levels of hNR1 splice variants in autopsied human brain. Quantitation of each hNR1 splice variant is performed using standard curve methodology in which a known amount of synthetic ribonucleic acid competitor (internal standard) is co-amplified against total RNA. This method can be used for the quantitation of hNR1 mRNA levels in response to acute or chronic disease states, in particular in the glutamatergic-associated neuronal loss observed in Alzheimer's disease [J. Neurochem. 78 (2001) 175]. Furthermore, alterations in hNR1 mRNA expression may be reflected at the translational level, resulting in functional changes in the NMDA receptor. (C) 2003 Elsevier Science B.V. All rights reserved.

Quantitation of human brain GABAA receptor isoforms by competitive RT-PCR

We have developed a competitive RT-PCR assay, adapted from Lewohl et al. [Brain Res. Brain Res. Protoc. 1 (1997) 347]. for the quantitation of GABA, receptor beta isoforms in human brain using an internal standard that shares high sequence homology to the targets. The internal standard is identical to the beta(1) sequence except for a 61 bp deletion and the incorporation of a Hind III restriction enzyme site. Unlike traditional competitive RT-PCR, which requires a range of internal standard concentrations to be titrated against a constant amount of unknown, this method relies on a standard curve for quantitation of each sample and thus permits increased sample throughput. This method is suitable for the quantitation of beta(1), beta(2) and beta(3) isoforms of the GABA(A) receptor in human alcoholic and control brain. (C) 2003 Elsevier Science B.V. All rights reserved.

The variety of variables in automated real-time refinement

The refinement calculus is a well-established theory for deriving program code from specifications. Recent research has extended the theory to handle timing requirements, as well as functional ones, and we have developed an interactive programming tool based on these extensions. Through a number of case studies completed using the tool, this paper explains how the tool helps the programmer by supporting the many forms of variables needed in the theory. These include simple state variables as in the untimed calculus, trace variables that model the evolution of properties over time, auxiliary variables that exist only to support formal reasoning, subroutine parameters, and variables shared between parallel processes.