Sciweavers

68 search results - page 3 / 14
» From boolean to quantitative synthesis
Sort
View
SCFBM
2008
119views more  SCFBM 2008»
13 years 5 months ago
Boolean network simulations for life scientists
Modern life sciences research increasingly relies on computational solutions, from large scale data analyses to theoretical modeling. Within the theoretical models Boolean network...
István Albert, Juilee Thakar, Song Li, Ranr...
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
13 years 11 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
TCAD
2002
121views more  TCAD 2002»
13 years 5 months ago
Robust Boolean reasoning for equivalence checking and functional property verification
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, ...
DLT
2009
13 years 4 months ago
Weighted versus Probabilistic Logics
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
Benedikt Bollig, Paul Gastin
ICCD
2003
IEEE
127views Hardware» more  ICCD 2003»
14 years 3 months ago
Structural Detection of Symmetries in Boolean Functions
Functional symmetries provide significant benefits for multiple tasks in synthesis and verification. Many applications require the manual specification of symmetries using spe...
Guoqiang Wang, Andreas Kuehlmann, Alberto L. Sangi...