Sciweavers

251 search results - page 39 / 51
» Lattice-Valued Binary Decision Diagrams
Sort
View
WIA
2004
Springer
14 years 3 months ago
A BDD-Like Implementation of an Automata Package
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
Jean-Michel Couvreur
DATE
2003
IEEE
99views Hardware» more  DATE 2003»
14 years 3 months ago
Fast Computation of Data Correlation Using BDDs
Data correlation is a well-known problem that causes difficulty in VLSI testing. Based on a correlation metric, an efficient heuristic to select BIST registers has been proposed...
Zhihong Zeng, Qiushuang Zhang, Ian G. Harris, Maci...
ICFCA
2009
Springer
14 years 2 months ago
Handling Large Formal Context Using BDD - Perspectives and Limitations
This paper presents Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts. The main id...
Andrei Rimsa, Luis E. Zárate, Mark A. J. So...
FM
2001
Springer
108views Formal Methods» more  FM 2001»
14 years 2 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
PAPM
2001
Springer
128views Mathematics» more  PAPM 2001»
14 years 2 months ago
Faster and Symbolic CTMC Model Checking
Abstract. This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (...
Joost-Pieter Katoen, Marta Z. Kwiatkowska, Gethin ...