333 search results - page 38 / 67 » On the complexity of partial order trace model checking |
ICMCS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we derive an analytical model for the evaluation of the performance of a Video on Demand (VoD) system. The model estimates the mean waiting time achievable by the P...
WCE
2007
13 years 8 months ago
2007
— Industrial plants makes a carefully trace of the human intervention on the process. This intervention happens at different points in the history of the facility, since the desi...
FMICS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
ICALP
1994
Springer
13 years 11 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
AOSE
2005
Springer
14 years 1 months ago
2005
Springer
In order to create adaptive Agent Systems with abilities matching those of their biological counterparts, a natural approach is to incorporate classical conditioning mechanisms int...