713 search results - page 123 / 143 » Model Checking and Transitive-Closure Logic |
111
click to vote
EON
2008
15 years 2 days ago
2008
We reuse here the framework, the setting, and the semantic modelling for the automated synthesis of the SWS Challenge Mediator presented in the companion paper [5], and show how to...
QEST
2008
IEEE
15 years 5 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
CAV
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. Many software model checkers are based on predicate abstraction. If the verification goal depends on pointer structures, the approach does not work well, because it is di...
ER
2004
Springer
15 years 4 months ago
2004
Springer
A major issue in the study of semantic Web services concerns the matching problem of Web services. Various techniques for this problem have been proposed. Typical ones include FSM ...
DLOG
2009
14 years 8 months ago
2009
Abstract. In this paper, we describe an approach for ontology comprehension support called model exploration in which models for ontologies are generated and presented interactivel...