The Sentential Decision Diagram (SDD) is a recently proposed representation of Boolean functions, containing Ordered Binary Decision Diagrams (OBDDs) as a distinguished subclass. While OBDDs are characterized by total variable orders, SDDs are characterized more generally by vtrees. As both OBDDs and SDDs have canonical representations, searching for OBDDs and SDDs of minimal size simplifies to...

Energy games, which model quantitative consumption of a limited resource, e.g., time or energy, play a central role in quantitative models for reactive systems. Reactive synthesis constructs a controller which satisfies a given specification, if one exists. For energy games a synthesized controller ensures to satisfy not only the safety constraints of the specification but also the quantitative...

The paper reports on first preliminary results and insights gained in a project aiming at implementing the fluent calculus using methods and techniques based on binary decision diagrams. After reporting on an initial experiment showing promising results we discuss our findings concerning various techniques and heuristics used to speed up the reasoning process.

The size of a Reduced Ordered Binary Decision Diagram (ROBDD) is directly influenced by the variables ordering technique used to build the ROBDD. Therefore various variables ordering techniques have been proposed to minimize the size of BDDs. Unfortunately there is no unique method that can be used to obtain the least number of nodes for all BDDs. In this paper we propose two new methods based ...

In this paper we extend one of the main tools used in verii-cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. We show how probabilistic vectors and matrices can be represented canonically and succinctly using proba-bilistic trees and graphs, and how simulation of large-scale probabilistic systems can be performed. We consider this work...

The size of the Ordered Binary Decision Diagram (OBDD) which represents a Boolean function greatly depends on the ordering of input variables. In this paper, we show that the size of the OBDD representing n-bits integer division is (2 n=8 ) even if any variable ordering is allowed to minimize the size of the OBDD. We also show that _-OBDDs and ^-OBDDs representing division have the same lower b...

ÐThis paper investigates reduced ordered binary decision diagrams (OBDD) of partially symmetric Boolean functions when using variable orders where symmetric variables are adjacent. We prove upper bounds for the size of such symmetry ordered OBDDs (SymOBDD). They generalize the upper bounds for the size of OBDDs of totally symmetric Boolean functions and nonsymmetric Boolean functions proven by ...

The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specification formalisms is a branching time logic that allows to reason about the coordination principles of and the data flow in the network. The underlying model checking algorithm relies on variants of standard automata-based a...

The paper is an exercise in formal program development. We rigorously show how planning problems encoded as entailment problems in the uent calculus can be mapped onto satissability problems for propositional formulas, which in turn can be mapped to the problem to nd models using binary decision diagrams. The mapping is shown to be sound and complete. Preliminary experimental results of an impl...