Sciweavers

125 search results - page 15 / 25
» Boolean Satisfiability with Transitivity Constraints
Sort
View
ISLPED
2010
ACM
158views Hardware» more  ISLPED 2010»
13 years 10 months ago
Temperature- and energy-constrained scheduling in multitasking systems: a model checking approach
The ongoing scaling of semiconductor technology is causing severe increase of on-chip power density and temperature in microprocessors. This has raised urgent requirement for both...
Weixun Wang, Xiaoke Qin, Prabhat Mishra
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
14 years 4 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
DAC
2006
ACM
14 years 10 months ago
Predicate learning and selective theory deduction for a difference logic solver
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
Chao Wang, Aarti Gupta, Malay K. Ganai
CP
2008
Springer
13 years 11 months ago
Probabilistically Estimating Backbones and Variable Bias: Experimental Overview
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
Eric I. Hsu, Christian J. Muise, J. Christopher Be...
TROB
2002
64views more  TROB 2002»
13 years 9 months ago
Synthesis of deadlock prevention supervisors using Petri nets
Given an arbitrary Petri net (PN) structure, which may have uncontrollable and unobservable transitions, the deadlock prevention procedure presented here determines a set of linear...
Marian V. Iordache, John O. Moody, Panos J. Antsak...