5180 search results - page 120 / 1036 » Concurrency, Time, and Constraints |
174
click to vote
CSCLP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
172
click to vote
ICCBSS
2005
Springer
15 years 12 months ago
2005
Springer
A vital issue in the correct use of commercial-off-the-shelf (COTS) components is the proper understanding of their functionality, quality attributes and ways of operation. Traditi...
189
click to vote
ISSTA
1998
ACM
15 years 10 months ago
1998
ACM
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
169
click to vote
OPODIS
2004
15 years 7 months ago
2004
Abstract. We present a formalism for modeling replication in a distributed system with concurrent users sharing information. It is based on actions, which represent operations requ...
151
click to vote
PPAM
2005
Springer
15 years 12 months ago
2005
Springer
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...