4340 search results - page 525 / 868 » Formal Methods and Cryptography |
207
click to vote
FORMATS
2004
Springer
16 years 2 days ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
205
click to vote
JELIA
2004
Springer
16 years 1 days ago
2004
Springer
Methods for computing the least common subsumer (lcs) are usually restricted to rather inexpressive Description Logics (DLs) whereas existing knowledge bases are written in very e...
167
click to vote
HPDC
2003
IEEE
15 years 12 months ago
2003
IEEE
Dynamic, heterogenous and distributively owned resource environments present unique challenges to the problems of resource representation, allocation and management. Conventional ...
172
click to vote
KCAP
2003
ACM
15 years 12 months ago
2003
ACM
Because it is difficult to engineer a complex ontology with time, we here consider a method that allows for factorizing the complexity of the engineering process, FONTE (Factoriz...
167
click to vote
FM
2003
Springer
15 years 12 months ago
2003
Springer
We present ProB, an animation and model checking tool for the B method. ProB’s animation facilities allow users to gain confidence in their specifications, and unlike the anima...