41 resultados para Direct Refinement
Resumo:
We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.
Resumo:
In this paper we demonstrate a refinement calculus for logic programs, which is a framework for developing logic programs from specifications. The paper is written in a tutorial-style, using a running example to illustrate how the refinement calculus is used to develop logic programs. The paper also presents an overview of some of the advanced features of the calculus, including the introduction of higher-order procedures and the refinement of abstract data types.
Specification, refinement and verification of concurrent systems: an integration of Object-Z and CSP
Resumo:
In this note we show by counter-example that the direct product of two weak uniquely completable partial latin squares is not necessarily a uniquely completable partial latin square. This counter-example rejects a conjecture by Gower (see [3]) on the direct product of two uniquely completable partial latin squares.
Resumo:
This study examined the utility of a stress and coping model of adjustment to HIV/AIDS. A total of 114 HN-infected gay or bisexual men were interviewed and they completed self-administered scales. Predictors included illness variables (disease stage and number of symptoms), coping resources (optimism and social support), appraisal (threat, challenge, and controllability), and coping strategies (problem-and emotion-focused). Adjustment outcomes were depression, global distress, social adjustment, and subjective health status. Results from hierarchical regression analyses indicated that better adjustment was related to an asymptomatic illness stage, fewer HN-related symptoms, greater social support, challenge and controllability appraisals, problem-focused coping, and lower threat appraisals and reliance on emotion focused coping. There was limited support for the stress-buffering effects of optimism. Findings support the utility of a stress and coping model of adjustment to HIV/AIDS.
Resumo:
This paper presents a method of formally specifying, refining and verifying concurrent systems which uses the object-oriented state-based specification language Object-Z together with the process algebra CSP. Object-Z provides a convenient way of modelling complex data structures needed to define the component processes of such systems, and CSP enables the concise specification of process interactions. The basis of the integration is a semantics of Object-Z classes identical to that of CSP processes. This allows classes specified in Object-Z to he used directly within the CSP part of the specification. In addition to specification, we also discuss refinement and verification in this model. The common semantic basis enables a unified method of refinement to be used, based upon CSP refinement. To enable state-based techniques to be used fur the Object-Z components of a specification we develop state-based refinement relations which are sound and complete with respect to CSP refinement. In addition, a verification method for static and dynamic properties is presented. The method allows us to verify properties of the CSP system specification in terms of its component Object-Z classes by using the laws of the the CSP operators together with the logic for Object-Z.
Resumo:
In this paper we focus on the identification of latin interchanges in latin squares which are the direct product of latin squares of smaller orders. The results we obtain on latin interchanges will be used to identify critical sets in direct products. This work is an extension of research carried out by Stinson and van Rees in 1982.
Resumo:
The first direct voltammetric response from a molybdenum enzyme under non-turnover conditions is reported. Cyclic voltammetry of dimethylsulfoxide reductase from Rhodobacter capsulatus reveals a reversible Mo-VI/V response at + 161 mV followed by a reversible Mo-V/IV response at -102 mV versus NHE at pH 8. The higher potential couple exhibits a pH dependence consistent with protonation upon reduction to the Mo-V state and we have determined the pK(a) for this semi-reduced species to be 9.0. The lower potential couple is pH independent within the range 5 < pH < 10. The optical spectrum of the Mo chromophore has been investigated with spectroelectrochemistry. At high potential, in its resting state, the enzyme exhibits a spectrum characteristic of the Mo-VI form. This changes significantly following bulk electrolysis (-400 mV versus NHE) at an optically transparent, indium-doped tin oxide working electrode, where a single visible electronic maximum at 632 nm is observed, which is comparable with spectra reported previously for the dithionite-reduced enzyme. This two-electron process is chemically reversible by reoxidizing the enzyme at the electrode in the absence of mediators or promoters. The activity of the enzyme has been established by observation of a catalytic current in the presence of DMSO at pH 8, where a sigmoidal (steady state) voltammogram is seen. Electronic supplementary material to this paper (Fig. S 1) can be obtained by using the Springer Link server located at http://dx.doi.org/10.1007/s00775-002-0374-y.
Resumo:
Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.
Resumo:
An acceleration compensated transducer was developed to enable the direct measurement of skin friction in hypervelocity impulse facilities. The gauge incorporated a measurement and acceleration element that employed direct shear of a piezoelectric ceramic. The design integrated techniques to maximize rise time and shear response while minimizing the affects of acceleration, pressure, heat transfer, and electrical interference. The arrangement resulted in a transducer natural frequency near 40 kHz. The transducer was calibrated for shear and acceleration in separate bench tests and was calibrated for pressure within an impulse facility. Uncertainty analyses identified only small experimental errors in the shear and acceleration calibration techniques. Although significant errors were revealed in the method of pressure calibration, total skin-friction measurement errors as low as +/-7-12% were established. The transducer was successfully utilized in a shock tunnel, and sample measurements are presented for flow conditions that simulate a flight Mach number near 8.