230 research outputs found

    SAT-Based Synthesis Methods for Safety Specs

    Full text link
    Automatic synthesis of hardware components from declarative specifications is an ambitious endeavor in computer aided design. Existing synthesis algorithms are often implemented with Binary Decision Diagrams (BDDs), inheriting their scalability limitations. Instead of BDDs, we propose several new methods to synthesize finite-state systems from safety specifications using decision procedures for the satisfiability of quantified and unquantified Boolean formulas (SAT-, QBF- and EPR-solvers). The presented approaches are based on computational learning, templates, or reduction to first-order logic. We also present an efficient parallelization, and optimizations to utilize reachability information and incremental solving. Finally, we compare all methods in an extensive case study. Our new methods outperform BDDs and other existing work on some classes of benchmarks, and our parallelization achieves a super-linear speedup. This is an extended version of [5], featuring an additional appendix.Comment: Extended version of a paper at VMCAI'1

    On QBF Proofs and Preprocessing

    Full text link
    QBFs (quantified boolean formulas), which are a superset of propositional formulas, provide a canonical representation for PSPACE problems. To overcome the inherent complexity of QBF, significant effort has been invested in developing QBF solvers as well as the underlying proof systems. At the same time, formula preprocessing is crucial for the application of QBF solvers. This paper focuses on a missing link in currently-available technology: How to obtain a certificate (e.g. proof) for a formula that had been preprocessed before it was given to a solver? The paper targets a suite of commonly-used preprocessing techniques and shows how to reconstruct certificates for them. On the negative side, the paper discusses certain limitations of the currently-used proof systems in the light of preprocessing. The presented techniques were implemented and evaluated in the state-of-the-art QBF preprocessor bloqqer.Comment: LPAR 201

    Incremental QBF Solving

    Full text link
    We consider the problem of incrementally solving a sequence of quantified Boolean formulae (QBF). Incremental solving aims at using information learned from one formula in the process of solving the next formulae in the sequence. Based on a general overview of the problem and related challenges, we present an approach to incremental QBF solving which is application-independent and hence applicable to QBF encodings of arbitrary problems. We implemented this approach in our incremental search-based QBF solver DepQBF and report on implementation details. Experimental results illustrate the potential benefits of incremental solving in QBF-based workflows.Comment: revision (camera-ready, to appear in the proceedings of CP 2014, LNCS, Springer

    Editorial: Videos in der (Hochschul-)Lehre

    Get PDF
    24.04.2014 | Thomas Antretter, Johannes Dorfinger, Martin Ebner, Michael Kopp, Walther Nagler, Jutta Pauschenwein, Michael Raunig, Manfred Rechberger, Herwig Rehatschek, Patrick Schweighofer, Reinhard Staber & Martin Teufel (Graz

    The Role of Geography in the Information Economy: The Case of Multimedia

    Full text link
    In der Diskussion um die Zukunft der Arbeit in der Informationsgesellschaft findet sich sehr hÀufig die Ansicht vertreten, dass durch die rapide fortschreitende Globalisierung wirtschaftliche Strukturen und AblÀufe zunehmend entrÀumlicht werden und ihre regionale Einbettung immer mehr an Bedeutung verliert. Der Beitrag versucht diese Behauptung zu relativieren. Er tut dies beispielhaft mittels einer Analyse der Multimedia-Industrie. Untersucht wird die rÀumliche Verteilung der Multimedia-Produzenten sowie die Unternehmens- und BeschÀftigungsstrukture

    Regulation of haemopoietic stem‐cell proliferation in mice carrying the Slj allele

    Get PDF
    We investigated a haemopoietic stromal defect, in mice heterozygous for the Slj allele, during haemopoietic stress induced by treatment with bacterial lipopolysaccharides (LPS) or lethal total body irradiation (TBI) and bone‐marrow cell (BMC) reconstitution. Both treatments resulted in a comparable haemopoietic stem cell (CFU‐s) proliferation in Slj/+ and +/+ haemopoietic organs. There was no difference in committed haemopoietic progenitor cell (BFU‐e and CFU‐G/M) kinetics after TBI and +/+ bone‐marrow transplantation in Slj/+ and +/+ mice. the Slj/+ mice were deficient in their ability to support macroscopic spleen colony formation (65% of +/+ controls) as measured at 7 and 10 days after BMC transplantation. However, the Slj/+ spleen colonies contained the same number of BFU‐E and CFU‐G/M as colonies from +/+ spleens, while their CFU‐s content was increased. On day 10 post‐transplantation, the macroscopic ‘missing’ colonies could be detected at the microscopic level. These small colonies contained far fewer CFU‐s than the macroscopic detectable colonies. Analysis of CFU‐s proliferation‐inducing activities in control and post‐LPS sera revealed that Slj/+ mice are normal in their ability to produce and to respond to humoral stem‐cell regulators. We postulate that Slj/+ mice have a normal number of splenic stromal ‘niches’ for colony formation. However, 35% of these niches is defective in its proliferative support. Copyrigh

    Parameterized Synthesis with Safety Properties

    Full text link
    Parameterized synthesis offers a solution to the problem of constructing correct and verified controllers for parameterized systems. Such systems occur naturally in practice (e.g., in the form of distributed protocols where the amount of processes is often unknown at design time and the protocol must work regardless of the number of processes). In this paper, we present a novel learning based approach to the synthesis of reactive controllers for parameterized systems from safety specifications. We use the framework of regular model checking to model the synthesis problem as an infinite-duration two-player game and show how one can utilize Angluin's well-known L* algorithm to learn correct-by-design controllers. This approach results in a synthesis procedure that is conceptually simpler than existing synthesis methods with a completeness guarantee, whenever a winning strategy can be expressed by a regular set. We have implemented our algorithm in a tool called L*-PSynth and have demonstrated its performance on a range of benchmarks, including robotic motion planning and distributed protocols. Despite the simplicity of L*-PSynth it competes well against (and in many cases even outperforms) the state-of-the-art tools for synthesizing parameterized systems.Comment: 18 page

    Ageing and entrepreneurial preferences

    Get PDF
    Previous research on age and entrepreneurship assumed homogeneity and downplayed age-related differences in the motives and aims underlying enterprising behaviour. We argue that the heterogeneity of entrepreneurship influences how the level of entrepreneurial activity varies with age. Using a sample of 2566 respondents from 27 European countries we show that entrepreneurial activity increases almost linearly with age for individuals who prefer to only employ themselves (self-employers), whereas it increases up to a critical threshold age (late 40s) and decreases thereafter for those who aspire to hire workers (owner-managers). Age has a considerably smaller effect on entrepreneurial behaviour for those who do not prefer self-employment but are pushed into it by lack of alternative employment opportunities (reluctant entrepreneurs). Our results question the conventional wisdom that entrepreneurial activity declines with age and suggest that effective responses to demographic changes require policy makers to pay close attention to the heterogeneity of entrepreneurial preferences
    • 

    corecore