Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations

We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presentation of rewrite rules as well as the involved order, and using results for well-structured transition systems. We apply the resulting procedure to the analysis of the Distributed Dining Philosophers protocol on an arbitrary network structure.Comment: Extended version of a submittion accepted at RP'14 Worksho

A Fully Verified Executable LTL Model Checker

International audienceWe present an LTL model checker whose code has been completely verified using the Isabelle theorem prover. The checker consists of over 4000 lines of ML code. The code is produced using recent Isabelle technology called the Refinement Framework, which allows us to split its correctness proof into (1) the proof of an abstract version of the checker, consisting of a few hundred lines of “formalized pseudocode”, and (2) a verified refinement step in which mathematical sets and other abstract structures are replaced by implementations of efficient structures like red-black trees and functional arrays. This leads to a checker that, while still slower than unverified checkers, can already be used as a trusted reference implementation against which advanced implementations can be tested. We report on the structure of the checker, the development process, and some experiments on standard benchmarks

Association of Under-Approximation Techniques for Generating Tests from Models

International audienceIn this paper we present a Model-Based Testing approach with which we generate tests from an abstraction of a source behavioural model. We show a new algorithm that computes the abstraction as an under-approximation of the source model. Our first contribution is to combine two previous approaches proposed by Ball and Pasareanu et al. to compute May, Must+ and Must- abstract transition relations. Prooftechniques are used to compute these transition relations. The tests obtained by covering the abstract transitions have to be instantiated from the source model. So, following Pasareanu et al., our algorithm additionally computes a concrete transition relation: the tests obtained as sequences of concrete transitions need not be instantiated from the source model. Another contribution is to propose a choice of relevant paramaters and heuristics to pilot the tests computation. We experiment our approach and compare it with a previous approach of ours to compute tests from an abstraction that over-approximates the source model

A theory of normed simulations

In existing simulation proof techniques, a single step in a lower-level specification may be simulated by an extended execution fragment in a higher-level one. As a result, it is cumbersome to mechanize these techniques using general purpose theorem provers. Moreover, it is undecidable whether a given relation is a simulation, even if tautology checking is decidable for the underlying specification logic. This paper introduces various types of normed simulations. In a normed simulation, each step in a lower-level specification can be simulated by at most one step in the higher-level one, for any related pair of states. In earlier work we demonstrated that normed simulations are quite useful as a vehicle for the formalization of refinement proofs via theorem provers. Here we show that normed simulations also have pleasant theoretical properties: (1) under some reasonable assumptions, it is decidable whether a given relation is a normed forward simulation, provided tautology checking is decidable for the underlying logic; (2) at the semantic level, normed forward and backward simulations together form a complete proof method for establishing behavior inclusion, provided that the higher-level specification has finite invisible nondeterminism.Comment: 31 pages, 10figure

Phototriggered release of tetrapeptide AAPV from coumarinyl and pyrenyl cages

Ala-Ala-Pro-Val (AAPV) is a bioactive tetrapeptide that inhibits human neutrophil elastase (HNE), an enzyme involved in skin chronic inflammatory diseases like psoriasis. Caged derivatives of this peptide were prepared by proper N- and C-terminal derivatisation through a carbamate or ester linkage, respectively, with two photoactive moieties, namely 7-methoxycoumarin-2-ylmethyl and pyren-2-ylmethyl groups. These groups were chosen to assess the influence of the photosensitive group and the type of linkage in the controlled photorelease of the active molecule. The caged peptides were irradiated at selected wavelengths of irradiation (254, 300, and 350 nm), and the photolytic process was monitored by HPLC-UV. The results established the applicability of the tested photoactive groups for the release of AAPV, especially for the derivative bearing the carbamate-linked pyrenylmethyl group, which displayed the shortest irradiation times for the release at the various wavelengths of irradiation (ca. 4 min at 254 nm, 8 min at 300 nm and 46 min at 350 nm).Thanks are due to the Fundação para a Ciência e Tecnologia (FCT, Portugal) for financial support to the portuguese NMR network (PTNMR, Bruker Avance III 400- Univ. Minho), FCT and FEDER (European Fund for Regional Development)- COMPETE-QREN-EU for financial support through the Chemistry Research Centre of the University of Minho (Ref. UID/QUI/00686/2013 and UID/QUI/0686/2016). A PhD grant to A.M.S. (SFRH/BD/80813/2011) is also acknowledged.info:eu-repo/semantics/publishedVersio

Design and analysis of solid state transformer

This paper tries to make appoint that Solid State Transformer is an effective replacement for the conventional L F (Low frequency) transformer. The common topologies of SST are discussed. The present drawbacks of LF transformer and the advantages and future applications of Solid State Transformer are also mentioned. A Solid State Transformer is a bit complex system to barrier of universal acceptance is discussed and projected. In this paper discusses the features of power electronic based solid state transformer and its application in different electrical field, where conventional transformer can be replaced by the solid state transformer

Role of gamma-aminobutyric acid type A (GABAA) receptor subtypes in acute benzodiazepine physical dependence-like effects: evidence from squirrel monkeys responding under a schedule of food presentation.

RATIONALE: Assays of schedule-controlled responding can be used to characterize the pharmacology of benzodiazepines and other GABAA receptor modulators, and are sensitive to changes in drug effects that are related to physical dependence. OBJECTIVE: The present study used this approach to investigate the role of GABAA receptor subtypes in mediating dependence-like effects following benzodiazepine administration. METHODS: Squirrel monkeys (n = 6) were trained on a fixed-ratio schedule of food reinforcement. Initially, the response rate-decreasing effects of chlordiazepoxide (0.1-10 mg/kg; nonselective GABAA receptor agonist), zolpidem (0.032-1.0 mg/kg; α1 subunit-containing GABAA subtype-preferring agonist), and HZ-166 (0.1-10 mg/kg; functionally selective α2 and α3 subunit-containing GABAA receptor agonist) were assessed. Next, acute dependence-like effects following single injections of chlordiazepoxide, zolpidem, and HZ-166 were assessed with flumazenil (0.1-3.2 mg/kg; nonselective GABAA receptor antagonist). Finally, acute dependence-like effects following zolpidem administration were assessed with βCCt and 3-PBC (0.1-3.2 mg/kg and 0.32-10 mg/kg, respectively; α1 subunit-containing GABAA receptor antagonists). RESULTS: Chlordiazepoxide, zolpidem, and HZ-166 produced dose- and time-dependent decreases in response rates, whereas flumazenil, βCCT, and 3-PBC were ineffective. After the drug effects waned, flumazenil produced dose-dependent decreases in response rates following administration of 10 mg/kg chlordiazepoxide and 1.0 mg/kg zolpidem, but not following any dose of HZ-166. Further, both βCCT and 3-PBC produced dose-dependent decreases in response rates when administered after 1.0 mg/kg zolpidem. CONCLUSIONS: These data raise the possibility that α1 subunit-containing GABAA receptors play a major role in physical dependence-related behaviors following a single injection of a benzodiazepine