5180 search results - page 143 / 1036 » Concurrency, Time, and Constraints |
164
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
185
click to vote
ICCAD
2009
IEEE
2009
IEEE
An efficient wakeup scheduling considering resource constraint for sensor-based power gating designs
15 years 4 months ago
Power gating has been a very effective way to reduce leakage power. One important design issue for a power gating design is to limit the surge current during the wakeup process. N...
169
click to vote
CAV
1998
Springer
15 years 10 months ago
1998
Springer
This paper presents a new algorithm for efficiently verifying timed systems. The new algorithm represents timing information using geometric regions and explores the timed state sp...
155
click to vote
FORMATS
2004
Springer
15 years 10 months ago
2004
Springer
The hierarchy of untimed equivalences is well understood for action-based systems. This is not the case for timed systems, where it is, for example, possible to detect concurrency ...
157
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
We present a process algebra suitable to the modelling of timed concurrent systems and to their efficient verification through model checking. The algebra is provided with two con...