Sciweavers

3221 search results - page 270 / 645
» Termination of Linear Programs
Sort
View
CCE
2004
15 years 6 months ago
Modeling and solving real-time scheduling problems by stochastic integer programming
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
Guido Sand, Sebastian Engell
CAV
2009
Springer
164views Hardware» more  CAV 2009»
16 years 7 months ago
InvGen: An Efficient Invariant Generator
Abstract. In this paper we present InvGen, an automatic linear arithmetic invariant generator for imperative programs. InvGen's unique feature is in its use of dynamic analysi...
Ashutosh Gupta, Andrey Rybalchenko
SPIN
2007
Springer
16 years 19 days ago
Minimal Counterexample Generation for SPIN
We propose an algorithm to compute a counterexample of minimal size to some property in a finite state program, using the same space constraints than SPIN. This algorithm uses nes...
Paul Gastin, Pierre Moro
ICALP
1998
Springer
15 years 10 months ago
Difficult Configurations - On the Complexity of LTrL
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
Igor Walukiewicz
ICALP
2009
Springer
15 years 10 months ago
Efficient Methods for Selfish Network Design
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...