445 search results - page 66 / 89 » Model Checking Quantitative Linear Time Logic |
106
click to vote
LPNMR
2001
Springer
15 years 4 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
111
click to vote
PADS
2009
ACM
15 years 6 months ago
2009
ACM
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
DSOM
2004
Springer
15 years 5 months ago
2004
Springer
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
102
click to vote
LOGCOM
2007
14 years 11 months ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
LMCS
2006
14 years 11 months ago
2006
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisi...