Sciweavers

1018 search results - page 167 / 204
» Abstraction and Refinement in Model Checking
Sort
View
EPEW
2010
Springer
13 years 7 months ago
Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
Ricardo J. Rodríguez, Jorge Júlvez
CORR
2010
Springer
71views Education» more  CORR 2010»
13 years 7 months ago
Sampled Semantics of Timed Automata
Sampled semantics of timed automata is a nite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems ed granularity of ti...
Parosh Aziz Abdulla, Pavel Krcál, Wang Yi
ECEASST
2008
60views more  ECEASST 2008»
13 years 7 months ago
Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
Leen Lambers, Hartmut Ehrig, Gabriele Taentzer
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 7 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell
TVLSI
1998
123views more  TVLSI 1998»
13 years 7 months ago
On-line fault detection for bus-based field programmable gate arrays
Abstract—We introduce a technique for on-line built-in selftesting (BIST) of bus-based field programmable gate arrays (FPGA’s). This system detects deviations from the intende...
N. R. Shnidman, William H. Mangione-Smith, Miodrag...