Sciweavers

493 search results - page 52 / 99
» Alternating Weighted Automata
Sort
View
ICFEM
2003
Springer
14 years 1 months ago
Generic Interacting State Machines and Their Instantiation with Dynamic Features
Interacting State Machines (ISMs) are used to model reactive systems and to express and verify their properties. They can be seen both as automata exchanging messages simultaneousl...
David von Oheimb, Volkmar Lotz
LATA
2010
Springer
14 years 3 months ago
Using Sums-of-Products for Non-standard Reasoning
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...
Rafael Peñaloza
CAI
2007
Springer
14 years 2 months ago
Learning Deterministically Recognizable Tree Series - Revisited
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
Andreas Maletti
ECAI
2004
Springer
14 years 2 months ago
Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predic...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
DSD
2005
IEEE
96views Hardware» more  DSD 2005»
13 years 10 months ago
Improvement of the Fault Coverage of the Pseudo-Random Phase in Column-Matching BIST
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
Peter Filter, Hana Kubatova