Sciweavers

297 search results - page 42 / 60
» Formal Analysis of a Non-Repudiation Protocol
Sort
View
SEFM
2007
IEEE
14 years 1 months ago
Disciplining Orchestration and Conversation in Service-Oriented Computing
We give a formal account of a calculus for modeling service-based systems, suitable to describe both service composition (orchestration) and the protocol that services run when in...
Ivan Lanese, Francisco Martins, Vasco Thudichum Va...
ARGMAS
2007
Springer
13 years 11 months ago
On the Benefits of Exploiting Hierarchical Goals in Bilateral Automated Negotiation
Interest-based negotiation (IBN) is a form of negotiation in which agents exchange information about their underlying goals, with a view to improving the likelihood and quality of ...
Iyad Rahwan, Philippe Pasquier, Liz Sonenberg, Fra...
IANDC
2008
115views more  IANDC 2008»
13 years 7 months ago
Fair multi-party contract signing using private contract signatures
A multi-party contract signing protocol allows a set of participants to exchange messages with each other with a view to arriving in a state in which each of them has a pre-agreed...
Aybek Mukhamedov, Mark Dermot Ryan
CSFW
2010
IEEE
13 years 11 months ago
Robustness Guarantees for Anonymity
—Anonymous communication protocols must achieve two seemingly contradictory goals: privacy (informally, they must guarantee the anonymity of the parties that send/receive informa...
Gilles Barthe, Alejandro Hevia, Zhengqin Luo, Tama...
FORMATS
2003
Springer
14 years 25 days ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...