Sciweavers

107 search results - page 1 / 22
» Computing subsets of equivalence classes for large FSMs
Sort
View
EURODAC
1995
IEEE
136views VHDL» more  EURODAC 1995»
13 years 8 months ago
Computing subsets of equivalence classes for large FSMs
Computing equivalence classes for FSMs has several applications to synthesis and veri cation problems. Symbolic traversal techniques are applicable to medium-small circuits. This ...
Gianpiero Cabodi, Stefano Quer, Paolo Camurati
JAIR
2007
108views more  JAIR 2007»
13 years 5 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen
HIPC
2004
Springer
13 years 10 months ago
A Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
David A. Bader, Kamesh Madduri
AI
2002
Springer
13 years 4 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
DAC
1997
ACM
13 years 9 months ago
Sequence Compaction for Probabilistic Analysis of Finite-State Machines
- The objective of this paper is to provide an effective technique for accurate modeling of the external input sequences that affect the behavior of Finite State Machines (FSMs). T...
Diana Marculescu, Radu Marculescu, Massoud Pedram