Sciweavers

221 search results - page 13 / 45
» Control Dependence for Extended Finite State Machines
Sort
View
DLT
2006
13 years 8 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
CN
2004
89views more  CN 2004»
13 years 7 months ago
On the testability of SDL specifications
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...
Robert M. Hierons, T.-H. Kim, Hasan Ural
IHM
2004
ACM
14 years 25 days ago
Couplage de ressources d'interaction
Although coupling interaction resources is key to ubiquitous computing, this notion has been overlooked in previous studies. In this paper, we address this notion in a more system...
Nicolas Barralon, Christophe Lachenal, Joëlle...
FOIKS
2008
Springer
13 years 9 months ago
Lossless Decompositions in Complex-Valued Databases
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
Henning Köhler, Sebastian Link
ICESS
2005
Springer
14 years 27 days ago
Self-correction of FPGA-Based Control Units
This paper presents a self-correcting control unit design using Hamming codes for finite state machine (FSM) state encoding. The adopted technique can correct single-bit errors and...
Iouliia Skliarova