1,012 research outputs found

    Should We Learn Probabilistic Models for Model Checking? A New Approach and An Empirical Study

    Get PDF
    Many automated system analysis techniques (e.g., model checking, model-based testing) rely on first obtaining a model of the system under analysis. System modeling is often done manually, which is often considered as a hindrance to adopt model-based system analysis and development techniques. To overcome this problem, researchers have proposed to automatically "learn" models based on sample system executions and shown that the learned models can be useful sometimes. There are however many questions to be answered. For instance, how much shall we generalize from the observed samples and how fast would learning converge? Or, would the analysis result based on the learned model be more accurate than the estimation we could have obtained by sampling many system executions within the same amount of time? In this work, we investigate existing algorithms for learning probabilistic models for model checking, propose an evolution-based approach for better controlling the degree of generalization and conduct an empirical study in order to answer the questions. One of our findings is that the effectiveness of learning may sometimes be limited.Comment: 15 pages, plus 2 reference pages, accepted by FASE 2017 in ETAP

    Bounded Model Checking for Probabilistic Programs

    Get PDF
    In this paper we investigate the applicability of standard model checking approaches to verifying properties in probabilistic programming. As the operational model for a standard probabilistic program is a potentially infinite parametric Markov decision process, no direct adaption of existing techniques is possible. Therefore, we propose an on-the-fly approach where the operational model is successively created and verified via a step-wise execution of the program. This approach enables to take key features of many probabilistic programs into account: nondeterminism and conditioning. We discuss the restrictions and demonstrate the scalability on several benchmarks

    Vocabulary Learning in a Yorkshire Terrier: Slow Mapping of Spoken Words

    Get PDF
    Rapid vocabulary learning in children has been attributed to “fast mapping”, with new words often claimed to be learned through a single presentation. As reported in 2004 in Science a border collie (Rico) not only learned to identify more than 200 words, but fast mapped the new words, remembering meanings after just one presentation. Our research tests the fast mapping interpretation of the Science paper based on Rico's results, while extending the demonstration of large vocabulary recognition to a lap dog. We tested a Yorkshire terrier (Bailey) with the same procedures as Rico, illustrating that Bailey accurately retrieved randomly selected toys from a set of 117 on voice command of the owner. Second we tested her retrieval based on two additional voices, one male, one female, with different accents that had never been involved in her training, again showing she was capable of recognition by voice command. Third, we did both exclusion-based training of new items (toys she had never seen before with names she had never heard before) embedded in a set of known items, with subsequent retention tests designed as in the Rico experiment. After Bailey succeeded on exclusion and retention tests, a crucial evaluation of true mapping tested items previously successfully retrieved in exclusion and retention, but now pitted against each other in a two-choice task. Bailey failed on the true mapping task repeatedly, illustrating that the claim of fast mapping in Rico had not been proven, because no true mapping task had ever been conducted with him. It appears that the task called retention in the Rico study only demonstrated success in retrieval by a process of extended exclusion

    Reductions in cardiovascular, cerebrovascular, and respiratory mortality following the national Irish smoking ban: Interrupted time-series analysis

    Get PDF
    Copyright @ 2013 Stallings-Smith et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.This article has been made available through the Brunel Open Access Publishing Fund.Background: Previous studies have shown decreases in cardiovascular mortality following the implementation of comprehensive smoking bans. It is not known whether cerebrovascular or respiratory mortality decreases post-ban. On March 29, 2004, the Republic of Ireland became the first country in the world to implement a national workplace smoking ban. The aim of this study was to assess the effect of this policy on all-cause and cause-specific, non-trauma mortality. Methods: A time-series epidemiologic assessment was conducted, utilizing Poisson regression to examine weekly age and gender-standardized rates for 215,878 non-trauma deaths in the Irish population, ages ≥35 years. The study period was from January 1, 2000, to December 31, 2007, with a post-ban follow-up of 3.75 years. All models were adjusted for time trend, season, influenza, and smoking prevalence. Results: Following ban implementation, an immediate 13% decrease in all-cause mortality (RR: 0.87; 95% CI: 0.76-0.99), a 26% reduction in ischemic heart disease (IHD) (RR: 0.74; 95% CI: 0.63-0.88), a 32% reduction in stroke (RR: 0.68; 95% CI: 0.54-0.85), and a 38% reduction in chronic obstructive pulmonary disease (COPD) (RR: 0.62; 95% CI: 0.46-0.83) mortality was observed. Post-ban reductions in IHD, stroke, and COPD mortalities were seen in ages ≥65 years, but not in ages 35-64 years. COPD mortality reductions were found only in females (RR: 0.47; 95% CI: 0.32-0.70). Post-ban annual trend reductions were not detected for any smoking-related causes of death. Unadjusted estimates indicate that 3,726 (95% CI: 2,305-4,629) smoking-related deaths were likely prevented post-ban. Mortality decreases were primarily due to reductions in passive smoking. Conclusions: The national Irish smoking ban was associated with immediate reductions in early mortality. Importantly, post-ban risk differences did not change with a longer follow-up period. This study corroborates previous evidence for cardiovascular causes, and is the first to demonstrate reductions in cerebrovascular and respiratory causes

    Prader–Willi syndrome and autism spectrum disorders: an evolving story

    Get PDF
    Prader–Willi syndrome (PWS) is well-known for its genetic and phenotypic complexities. Caused by a lack of paternally derived imprinted material on chromosome 15q11–q13, individuals with PWS have mild to moderate intellectual disabilities, repetitive and compulsive behaviors, skin picking, tantrums, irritability, hyperphagia, and increased risks of obesity. Many individuals also have co-occurring autism spectrum disorders (ASDs), psychosis, and mood disorders. Although the PWS 15q11–q13 region confers risks for autism, relatively few studies have assessed autism symptoms in PWS or directly compared social, behavioral, and cognitive functioning across groups with autism or PWS. This article identifies areas of phenotypic overlap and difference between PWS and ASD in core autism symptoms and in such comorbidities as psychiatric disorders, and dysregulated sleep and eating. Though future studies are needed, PWS provides a promising alternative lens into specific symptoms and comorbidities of autism

    Regular symmetry patterns

    Get PDF
    Symmetry reduction is a well-known approach for alleviating the state explosion problem in model checking. Automatically identifying symmetries in concurrent systems, however, is computationally expensive. We propose a symbolic framework for capturing symmetry patterns in parameterised systems (i.e. an infinite family of finite-state systems): two regular word transducers to represent, respectively, parameterised systems and symmetry patterns. The framework subsumes various types of "symmetry relations" ranging from weaker notions (e.g. simulation preorders) to the strongest notion (i.e. isomorphisms). Our framework enjoys two algorithmic properties: (1) symmetry verification: given a transducer, we can automatically check whether it is a symmetry pattern of a given system, and (2) symmetry synthesis: we can automatically generate a symmetry pattern for a given system in the form of a transducer. Furthermore, our symbolic language allows additional constraints that the symmetry patterns need to satisfy to be easily incorporated in the verification/synthesis. We show how these properties can help identify symmetry patterns in examples like dining philosopher protocols, self-stabilising protocols, and prioritised resource-allocator protocol. In some cases (e.g. Gries's coffee can problem), our technique automatically synthesises a safety-preserving finite approximant, which can then be verified for safety solely using a finite-state model checker.UPMAR
    corecore