Sciweavers

123 search results - page 5 / 25
» Optimizing Bounded Model Checking for Linear Hybrid Systems
Sort
View
CAV
2005
Springer
127views Hardware» more  CAV 2005»
15 years 3 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
HYBRID
2007
Springer
15 years 3 months ago
Optimal Switches in Multi-inventory Systems
Given a switched multi–inventory system we wish to find the optimal schedule of the resets to maintain the system in a safe operating interval, while minimizing a function relat...
Dario Bauso
110
Voted
TNN
2010
182views Management» more  TNN 2010»
14 years 4 months ago
A discrete-time neural network for optimization problems with hybrid constraints
Abstract--Recurrent neural networks have become a prominent tool for optimizations including linear or nonlinear variational inequalities and programming, due to its regular mathem...
Huajin Tang, Haizhou Li, Zhang Yi
CSCLP
2008
Springer
14 years 11 months ago
Challenges in Constraint-Based Analysis of Hybrid Systems
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
Andreas Eggers, Natalia Kalinnik, Stefan Kupfersch...
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
15 years 4 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert