Sciweavers

1192 search results - page 109 / 239
» Symbolic Query Exploration
Sort
View
APN
2004
Springer
15 years 8 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo
FDL
2003
IEEE
15 years 8 months ago
Using Rewriting-Logic Notation for Funcional Verification in Data-Stream Based Reconfigurable Computing
Reconfigurable Systolic Arrays are a generalization of Systolic Arrays where node operations and interconnections can be redefined even at run time. This flexibility increases the...
Mauricio Ayala-Rincón, Ricardo P. Jacobi, C...
DATE
2010
IEEE
173views Hardware» more  DATE 2010»
15 years 8 months ago
Robust design of embedded systems
—This paper presents a methodology to evaluate and optimize the robustness of an embedded system in terms of invariability in case of design revisions. Early decisions in embedde...
Martin Lukasiewycz, Michael Glaß, Jürge...
IWSAS
2001
Springer
15 years 7 months ago
Constraint-Guided Self-adaptation
We present an approach to self-adaptive systems utilizing explicit models of the design-space of the application. The design-space is captured by allowing the specification of alte...
Sandeep Neema, Ákos Lédeczi
ATS
1997
IEEE
89views Hardware» more  ATS 1997»
15 years 7 months ago
Guaranteeing Testability in Re-encoding for Low Power
This paper considers the testability implications of low power design methodologies. Low power and high testability are shown to be highly contrasting requirements, and an optimiz...
Silvia Chiusano, Fulvio Corno, Paolo Prinetto, Mau...