Results 1  10
of
46
Implementation of Symbolic Model Checking for Probabilistic Systems
, 2002
"... In this thesis, we present ecient implementation techniques for probabilistic model checking, a method which can be used to analyse probabilistic systems such as randomised distributed algorithms, faulttolerant processes and communication networks. A probabilistic model checker inputs a probabilist ..."
Abstract

Cited by 72 (21 self)
 Add to MetaCart
In this thesis, we present ecient implementation techniques for probabilistic model checking, a method which can be used to analyse probabilistic systems such as randomised distributed algorithms, faulttolerant processes and communication networks. A probabilistic model checker inputs a probabilistic model and a speci cation, such as \the message will be delivered with probability 1", \the probability of shutdown occurring is at most 0.02" or \the probability of a leader being elected within 5 rounds is at least 0.98", and can automatically verify if the speci cation is true in the model.
Difference decision diagrams
 University of Copenhagen
, 1999
"... This paper describes a new data structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form ¡£¢¥¤§¦© ¨ and ¡�¢¥¤���¨ where the variables are integer or realvalued. We give algorithms for manipulating DDDs and for determining functional properties ( ..."
Abstract

Cited by 51 (2 self)
 Add to MetaCart
This paper describes a new data structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form ¡£¢¥¤§¦© ¨ and ¡�¢¥¤���¨ where the variables are integer or realvalued. We give algorithms for manipulating DDDs and for determining functional properties (tautology, satisfiability, and equivalence). DDDs enable an efficient verification of timed systems modeled as, for example, timed automata or timed Petri nets, since both the states and their associated timing information can be represented symbolically, similar to how ROBDDs represent Boolean predicates.
Efficient compilation techniques for large scale feature models
, 2008
"... Feature modeling is used in generative programming and software productline engineering to capture the common and variable properties of programs within an application domain. The translation of feature models to propositional logics enabled the use of reasoning systems, such as BDD engines, for th ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
(Show Context)
Feature modeling is used in generative programming and software productline engineering to capture the common and variable properties of programs within an application domain. The translation of feature models to propositional logics enabled the use of reasoning systems, such as BDD engines, for the analysis and transformation of such models and interactive configurations. Unfortunately, the size of a BDD structure is highly sensitive to the variable ordering used in its construction and an inappropriately chosen ordering may prevent the translation of a feature model into a BDD representation of a tractable size. Finding an optimal order is NPhard and has for long been addressed by using heuristics. We review existing general heuristics and heuristics from the hardware circuits domain and experimentally show that they are not effective in reducing the size of BDDs produced from feature models. Based on that analysis we introduce two new heuristics for compiling feature models to BDDs. We demonstrate the effectiveness of these heuristics using publicly available and automatically generated models. Our results are directly applicable in construction of feature modeling tools.
BDDBased Decision Procedures for K
, 2002
"... We describe BDDbased decision procedures for K. Our approach is inspired by the automatatheoretic approach, but we avoid explicit automata construction. Our algorithms compute the fixpoint of a set of types, which are sets of formulas satisfying some conststency conditions. We use BDDs to represen ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
We describe BDDbased decision procedures for K. Our approach is inspired by the automatatheoretic approach, but we avoid explicit automata construction. Our algorithms compute the fixpoint of a set of types, which are sets of formulas satisfying some conststency conditions. We use BDDs to represent and manipulate such sets. Experimental results show that our algorithms are competitive with contemporary methods using benchmarks from TANCS 98 and TANCS 2000.
Symbolic Synthesis And Verification of Hierarchical Interfacebased Supervisory Control
, 2006
"... Hierarchical Interfacebased Supervisory Control (HISC) is a method to alleviate the stateexplosion problem when verifying the controllable and nonblocking properties of a large discrete event system. By decomposing a system as a number of subsystems according to the HISC method, we can verify the ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
Hierarchical Interfacebased Supervisory Control (HISC) is a method to alleviate the stateexplosion problem when verifying the controllable and nonblocking properties of a large discrete event system. By decomposing a system as a number of subsystems according to the HISC method, we can verify the subsystems separately and the global system controllability and nonblocking property are guaranteed, so that potentially great computation e#ort is saved. In this thesis, we first present a predicatebased synthesis algorithm for each type of subsystem and then prove the correctness of the algorithms. Then a predicatebased verification algorithm for each type of subsystem is provided. Based on the predicatebased algorithms, a symbolic implementation is proposed by using Binary Decision Diagrams (BDD) and the fact that a subsystem is usually composed of a number of components. With the symbolic implementation, we can handle a much larger subsystem of each type. Two large and complicated examples (with estimated worstcase state space on the order of 10^30 ) extended from the AIP example are provided for demonstrating the capabilities of the algorithms and the implementation. A software tool for the synthesis and verification using our approach is also developed.
A formal semantics for feature cardinalities in feature diagrams
 in Proc. Wks. VaMoS’11
, 2011
"... Feature cardinalities in feature diagrams determine the number of times a feature and its subtree can be duplicated during configuration by an operation named “cloning”. Other authors already investigated the problem and published different proposals of semantics for this construct. However, this ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
(Show Context)
Feature cardinalities in feature diagrams determine the number of times a feature and its subtree can be duplicated during configuration by an operation named “cloning”. Other authors already investigated the problem and published different proposals of semantics for this construct. However, this previous work is not easily amenable to the formal study of the various properties of feature diagrams and their derived configurations. Also, crosstree constraint languages still need to be properly extended to account for feature cardinalities. This paper presents an extension of an earlier formal semantics of feature diagrams by adding support for feature cardinalities. 1.
Technique and tool for symbolic representation and manipulation of stochastic transition systems
, 1998
"... ..."
Iktara in ConCert: Realizing a Certified Grid Computing Framework from a Programmer's Perspective
, 2002
"... With the vast amount of computing resources distributed throughout the world today, the prospect of e#ectively harnessing these resources has captivated the imaginations of many and motivated both industry and academia to pursue this dream. We believe that fundamental to the realization of this ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
With the vast amount of computing resources distributed throughout the world today, the prospect of e#ectively harnessing these resources has captivated the imaginations of many and motivated both industry and academia to pursue this dream. We believe that fundamental to the realization of this dream is the establishment of trust between application developers and resource donors as donors often receive little or no direct reward for their contributions. The ConCert project (to which this specific undertaking contributes) seeks to develop the theoretical and engineering foundation for grid computing in such a trustless setting based on the notion of certified code.
A BDDBased Approach for Modeling Plant and Supervisor by Extended Finite Automata
 IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY
, 2011
"... In this paper, we settle some problems that are encountered when modeling and synthesizing complex industrial systems by the supervisory control theory. First, modeling such huge systems with explicit statetransition models typically results in an intractable model. An alternative modeling approach ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In this paper, we settle some problems that are encountered when modeling and synthesizing complex industrial systems by the supervisory control theory. First, modeling such huge systems with explicit statetransition models typically results in an intractable model. An alternative modeling approach is to use extended finite automata (EFAs), which is an augmentation of ordinary automata with variables. The main advantage of utilizing EFAs for modeling is that more compact models are obtained. The second problem concerns the ease to understand and implement the supervisor. To handle this problem, we represent the supervisor in a modular manner by extending the original EFAs by compact conditional expressions. This will provide a framework for the users where they can bothmodel their system and obtain the supervisor in form of EFAs. In order to be able to handle complex systems efficiently, the models are symbolically represented by binary decision diagrams (BDDs). All computations that are performed in this framework are based on BDD operations. The framework has been implemented in a supervisory control tool and applied to industrially relevant benchmark problems.
An efficient representation for solving Catalan number related problems, Int
 J. of Pure and Applied Math
"... Abstract: Nowadays, more and more computations, in artificial intelligence, knowledge representation, and scientific computations to name a few, require complex data processing and sophisticated algorithms, which are NP hard. Solutions to such problems might range from succinct data representations ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract: Nowadays, more and more computations, in artificial intelligence, knowledge representation, and scientific computations to name a few, require complex data processing and sophisticated algorithms, which are NP hard. Solutions to such problems might range from succinct data representations to parallelized and incremental algorithms. In this paper Catalan related problems are discussed. For efficient computation of Catalan combinations a succinct representation is used and several algorithms are developed. Results show that the suggested approach can be successfully used for solving different Catalan problems. AMS Subject Classification: 68P05