Sciweavers

507 search results - page 52 / 102
» Counterexample-Guided Abstraction Refinement
Sort
View
FMSB
2008
130views Formal Methods» more  FMSB 2008»
13 years 11 months ago
Approximating Continuous Systems by Timed Automata
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...
Oded Maler, Grégory Batt
ENTCS
2008
135views more  ENTCS 2008»
13 years 10 months ago
Formal Specification Generation from Requirement Documents
Automatic generation of formal specifications from requirement reduces cost and complexity of formal models creation. Thus, the generated formal model brings the possibility to ca...
Gustavo Cabral, Augusto Sampaio
QEST
2010
IEEE
13 years 7 months ago
DTMC Model Checking by SCC Reduction
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
Erika Ábrahám, Nils Jansen, Ralf Wim...
GI
2009
Springer
13 years 7 months ago
Specification based testing of automotive human machine interfaces
Abstract: Model based testing promises systematic test coverage in a continuous testing process. However, in practice, model based testing struggles with informal specifications, d...
Holger Grandy, Sebastian Benz
IFIP12
2009
13 years 7 months ago
Managing Diagnosis Processes with Interactive Decompositions
Abstract In the scientific literature, it is generally assumed that models can be completely established before the diagnosis analysis. However, in the actual maintenance problems,...
Quang-Huy Giap, Stéphane Ploix, Jean-Marie ...