6608 search results - page 243 / 1322 » On the Completeness of Model Checking |
133
click to vote
TBILLC
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. In this paper, we present a game theoretic account of a subclass of ‘relevance’ implicatures arising from irrelevant answers. We show that these phenomena can be expl...
131
click to vote
CONCUR
1993
Springer
15 years 10 months ago
1993
Springer
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
138
click to vote
EUROCAST
2009
Springer
15 years 9 months ago
2009
Springer
The calculation of Hamiltonian Circuits is an NP-complete task. This paper uses slightly modified complete sets of Hamiltonian circuits for the classification of documents. The sol...
146
click to vote
JANCL
2007
15 years 5 months ago
2007
In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we ...
149
click to vote
APLAS
2005
ACM
15 years 7 months ago
2005
ACM
In this paper we propose a new parametric abstract finite model of Mobile Ambients able to express several properties on processes. The model can be used for the analysis of these...