Sciweavers

164 search results - page 16 / 33
» Formal testing from timed finite state machines
Sort
View
ENTCS
2006
119views more  ENTCS 2006»
13 years 7 months ago
Trace Machines for Observing Continuous-Time Markov Chains
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
Verena Wolf, Christel Baier, Mila E. Majster-Ceder...
ICML
2006
IEEE
14 years 8 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
FORMATS
2006
Springer
13 years 11 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
PTS
2007
81views Hardware» more  PTS 2007»
13 years 9 months ago
An EFSM-Based Passive Fault Detection Approach
Extended Finite State Machine (EFSM)-based passive fault detection involves modeling the system under test (SUT) as an EFSM M, monitoring the input/output behaviors of the SUT, and...
Hasan Ural, Zhi Xu
MSO
2003
13 years 9 months ago
Control System Design of the CERN/CMS Tracker Thermal Screen
The Tracker is one of the CMS (Compact Muon Solenoid experiment) detectors to be installed at the LHC (Large Hadron Collider) accelerator, scheduled to start data taking in 2007. ...
Enzo Carrone, Andromachi Tsirou