Sciweavers

2873 search results - page 486 / 575
» Model Checking and the Mu-calculus
Sort
View
AAMAS
2007
Springer
13 years 8 months ago
An algebra for commitment protocols
Protocols enable unambiguous, smooth interactions among agents. Commitments among agents are a powerful means of developing protocols. Commitments enable flexible execution of pro...
Ashok U. Mallya, Munindar P. Singh
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 8 months ago
New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
Damien Vergnaud
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 8 months ago
Static Analysis using Parameterised Boolean Equation Systems
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
María-del-Mar Gallardo, Christophe Joubert,...
ENTCS
2006
173views more  ENTCS 2006»
13 years 8 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
INTERNET
2006
144views more  INTERNET 2006»
13 years 8 months ago
Analyzing Conversations of Web Services
A conversation is the global sequence of messages exchanged among the components of a distributed system. Conversations provide a promising model for specifying and analyzing the ...
Tevfik Bultan, Jianwen Su, Xiang Fu