310 search results - page 13 / 62 » Sound and complete models of contracts |
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
EMISA
2002
Springer
13 years 7 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...
APAL
2010
13 years 7 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...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we continue the study the round complexity of black-box zero knowledge in the bare public-key (BPK, for short) model previously started by Micali and Reyzin in [11]....
LOGCOM
2006
13 years 7 months ago
2006
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate propertie...