3335 search results - page 93 / 667 » Grid result checking |
156
click to vote
ASIAN
2003
Springer
15 years 8 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
123
click to vote
CAV
2003
Springer
15 years 8 months ago
2003
Springer
In previous work, we showed how structural information can be used to efficiently generate the state-space of asynchronous systems. Here, we apply these ideas to symbolic CTL model...
ENTCS
2006
15 years 3 months ago
2006
We implement a specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers and compare the results. Key words: Crypto...
125
click to vote
OTM
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we present generic algorithms to ensure the consistency of mutual-exclusion and binding constraints in a business process context. We repeatedly identified the need...
160
click to vote
CADE
2007
Springer
16 years 3 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...