402 search results - page 47 / 81 » Model Checking Quantified Computation Tree Logic |
DLOG
2003
14 years 11 days ago
2003
The purpose of the chapter is to help someone familiar with DLs to understand the issues involved in developing an ontology for some universe of discourse, which is to become a co...
QEST
2008
IEEE
14 years 5 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
JNW
2006
13 years 11 months ago
2006
Abstract--Highly distributed environments such as pervasive computing environments not having global or broad control, need another attribute certificate management technique. For ...
VLSID
2001
IEEE
14 years 11 months ago
2001
IEEE
In this paper we describe a hardware design method for memory and register arrays that allows the application of formal equivalence checking for comparing a high-level register tr...
PODS
1994
ACM
14 years 3 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...