PAT BDD Library is a .Net library for symbolic model checking. It includes a .Net interface to the CUDD package (version 2.4.2). More importantly, it also contains many functions to get BDD encoding of a system easily. A system often consists of many components and primitive components described by transition systems are encoded it first, then these encodings are composed by our supported CSP-l...

Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...

Symbolic data structures using Binary Decision Diagrams (BDDs) have been successfully used in the last decades to analyse large systems. While various BDD and MTBDD packages have been developed in the community, the CUDD package remains the default choice of most of the symbolic (probabilistic) model checkers. In this paper, we provide the first comparative study of the performance of various B...

In mammals, survival both before and after birth depends on a number of key physiological processes such as the provision of 02, a supply of oxidative substrates and a means of removing the waste products of metabolism. In adults these processes are carried out by a number of different tissues, whereas in the fetus they are carried out primarily by the placenta. The successful transition from i...

This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...

Binary decision diagrams (BDDs) are widely used to mitigate the state-explosion problem in model checking. A variation of BDDs Zero-suppressed Decision Diagrams (ZDDs) which omit variables that must be false, instead omitting do not matter. We use ZDDs symbolically encode Kripke models Dynamic Epistemic Logic, a framework reason about knowledge and information dynamics multi-agent systems. comp...

BDDs (binary decision diagrams) are ubiquitous in formal verificationtools, and the time and memory used by the BDD package is frequently the con-straint that prevents application of formal verification. Accordingly, several re-searchers have investigated using parallel processing for BDDs. In this paper, wepresent a parallel BDD package with several novel features. The parallel...

Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for Probabilistic Timed Automata (PTA) based on MTBDDs. The timing information is encoded via placeholders stored in the MTBDDs that are independent of how the timing information is represented. Using the Colorado Univer...

This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent probabilistic systems as models; these allow nondeterministic choice between probability distributions and are particularly well suited to modelling distributed systems with probabilistic behaviour, e.g. randomized c...

BDD is an efficient data structure that in last few years has been used effectively in computer science and engineering. BDD-based attack in key stream cryptanalysis is supposed to be one of the best forms of attack in its kind. In this paper, we propose a new key stream attack which is based on ZDD(a variant of BDD). We show how our ZDD-based key stream attack can be used against the E0 type o...