Sciweavers

96 search results - page 11 / 20
» Fault Diagnosis in Extended Finite State Machines
Sort
View
IJCAI
2003
13 years 8 months ago
Formal Verification of Diagnosability via Symbolic Model Checking
This paper addresses the formal verification of diagnosis systems. We tackle the problem of diagnosability: given a partially observable dynamic system, and a diagnosis system obs...
Alessandro Cimatti, Charles Pecheur, Roberto Cavad...
INTERNET
2006
149views more  INTERNET 2006»
13 years 6 months ago
Concurrent Multiple-Issue Negotiation for Internet-Based Services
Negotiation is a technique for reaching mutually beneficial agreement among autonomous entities. A concurrent negotiation problem occurs when one entity is negotiating simultaneous...
Jiangbo Dang, Michael N. Huhns
ICML
2010
IEEE
13 years 4 months ago
Constructing States for Reinforcement Learning
POMDPs are the models of choice for reinforcement learning (RL) tasks where the environment cannot be observed directly. In many applications we need to learn the POMDP structure ...
M. M. Hassan Mahmud
CN
2004
89views more  CN 2004»
13 years 6 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
DATE
1998
IEEE
74views Hardware» more  DATE 1998»
13 years 11 months ago
State Relaxation Based Subsequence Removal for Fast Static Compaction in Sequential Circuits
We extend the subsequence removal technique to provide signi cantly higher static compaction for sequential circuits. We show that state relaxation techniques can be used to ident...
Michael S. Hsiao, Srimat T. Chakradhar