1302 search results - page 94 / 261 » Soundness in the Public-Key Model |
158
click to vote
EMISA
2002
Springer
15 years 6 months ago
2002
Springer
Abstract: This paper presents a new net-reduction methodology to facilitate the analysis of large workflow models. We propose an enhanced algorithm based on reducible subnet identi...
162
click to vote
ATAL
2005
Springer
16 years 23 hour ago
2005
Springer
We develop a sound foundation for model checking algorithms for the class of PRS-style BDI agents, by showing how a reachability graph for any given PRS-type agent can be construc...
146
click to vote
MABS
2000
Springer
15 years 10 months ago
2000
Springer
g of target systems attempted but rather an abstraction of the target systems is modelled and insights bout the abstraction then applied back to the target systems. The MABS modell...
210
click to vote
EWCBR
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we introduce a new instance-based approach to the label ranking problem. This approach is based on a probability model on rankings which is known as the Mallows mode...
147
click to vote
APAL
2010
15 years 6 months ago
2010
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the meaning of the new notion and its a...