Learn More
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking algorithms and thus support the verification of DTMCs. However, these algorithms do not provide any diagnostic information in the form of counterexamples, which are highly(More)
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)
This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed reachability analysis of uniform continuous-time Markov decision processes, which are generated from STATEMATE models. We give a detailed explanation of several construction, transformation,(More)
We present a uniform signature-based approach to compute the most popular bisimulations. Our approach is implemented symbolically using BDDs, which enables the handling of very large transition systems. Signatures for the bisimulations are built up from a few generic building blocks, which naturally correspond to efficient BDD operations. Thus, the(More)
This paper presents the tool COMICS 1.0, which performs model checking and generates counterexamples for DTMCs. For an input DTMC, COMICS computes an abstract system that carries the model checking information and uses this result to compute a critical subsystem, which induces a counterexample. This abstract subsystem can be refined and concretized(More)
We consider the partial equivalence checking problem (PEC), i. e., checking whether a given partial implementation of a combinational circuit can (still) be extended to a complete design that is equivalent to a given full specification. To solve PEC, we give a linear transformation from PEC to the question whether a dependency quantified Boolean formula(More)
In this paper we present optimizations for a BDD-based algorithm for the computation of several types of bisimulations which play an important role for minimisation of large systems thus enabling their verification. The basic principle of the algorithm is partition refinement. Our proposed optimizations take this refinement-structure as well as the usage of(More)
BACKGROUND & AIMS Glycochenodeoxycholate (GCDC) and taurolithocholate (TLC) are hepatotoxic and cholestatic bile salts, whereas tauroursodeoxycholate (TUDC) is cytoprotective and anticholestatic. Yet they all act, in part, through phosphatidylinositol-3-kinase(PI3K)-dependent mechanisms ("PI3K-paradox"). Hepatocytes express three catalytic PI3K Class I(More)
Apoptosis induced by hydrophobic bile acids is thought to contribute to liver injury during cholestasis. Caspase-6 is an executioner caspase that also appears to have regulatory functions in hematopoetic cell lines. We aimed to elucidate the role of caspase-6 in bile acid-induced apoptosis. The major human hydrophobic bile acid, glycochenodeoxycholic acid(More)