#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2009

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ralf Wimmer, Bettina Braitling, +5 authors Oliver E. Theel
- QEST
- 2010

Model checkers for concurrent probabilistic systems have become very popular within the last decade. The study of long-run average behavior has however received only scant attention in this area, at least from the implementation perspective. This paper studies the problem of how to efficiently realize an algorithm for computing optimal long-run average… (More)

- Piet Engelke, Bernd Becker, Michel Renovell, Jürgen Schlöffel, Bettina Braitling, Ilia Polian
- ACM Trans. Design Autom. Electr. Syst.
- 2009

A high-performance resistive bridging fault simulator SUPERB (Simulator Utilizing Parallel Evaluation of Resistive Bridges) is proposed. It is based on fault sectioning in combination with parallel-pattern or parallel-fault multiple-stuck-at simulation. It outperforms a conventional interval-based resistive bridging fault simulator by three orders of… (More)

- Ralf Wimmer, Bettina Braitling, Bernd Becker
- VMCAI
- 2009

Since its introduction in 1999, bounded model checking has gained industrial relevance for detecting errors in digital and hybrid systems. One of the main reasons for this is that it always provides a counterexample when an erroneous execution trace is found. Such a counterexample can guide the designer while debugging the system. In this paper we are… (More)

- Bettina Braitling, Ralf Wimmer, Bernd Becker, Nils Jansen, Erika Ábrahám
- FMOODS/FORTE
- 2011

Generation of counterexamples is a highly important task in the model checking process. In contrast to, e. g., digital circuits where counterexamples typically consist of a single path leading to a critical state of the system, in the probabilistic setting counterexamples may consist of a large number of paths. In order to be able to handle large systems… (More)

- Pepijn Crouzen, Ernst Moritz Hahn, +5 authors Bernd Becker
- ACSD
- 2011

- Bettina Braitling, Ralf Wimmer, Bernd Becker, Erika Ábrahám
- MBMV
- 2013

We extend the available SAT/SMT-based methods for generating counterexamples of probabilistic systems in two ways: First, we propose bounded rewards, which are appropriate, e. g., to model the energy consumption of autonomous embedded systems, and show how to extend the SMT-based counterexample generation to handle such models. Second, we describe a… (More)

ion in general is based on a partition P = {B1,B2, . . . ,Bn} of the state space. The original or concrete states are lumped together into abstract states, defined by the blocks Bi ∈P . For PA, both gameand menu-based abstraction use these blocks Bi as player 1 states (i. e. V1 = P). In game-based abstraction [18] for PA player 2 states in V2 represent sets… (More)

- Hassan Hatefi, Ralf Wimmer, Bettina Braitling, Luis María Ferrer Fioriti, Bernd Becker, Holger Hermanns
- Formal Aspects of Computing
- 2015

Costs and rewards are important tools for analysing quantitative aspects of models like energy consumption and costs of maintenance and repair. Under the assumption of transient costs, this paper considers the computation of expected cost-bounded rewards and cost-bounded reachability for Markov automata and Markov games. We provide a fixed point… (More)

- Bettina Braitling, Ralf Wimmer, Bernd Becker, Nils Jansen, Erika Ábrahám
- MBMV
- 2011

Counterexamples are a highly important feature of the model checking process. In contrast to, e. g., digital circuits where counterexamples typically consist of a single path leading to a critical state of the system, in the probabilistic setting, counterexamples may consist of a large number of paths. In order to be able to handle large systems and to use… (More)