The following pages link to Model checking Russian cards (Q2852032):
Displaying 12 items.
- A colouring protocol for the generalized Russian cards problem (Q391146) (← links)
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs (Q406700) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- Crossing hands in the Russian cards problem (Q2148821) (← links)
- Combinatorial solutions providing improved security for the generalized Russian cards problem (Q2248647) (← links)
- Logics of Rational Interaction (Q2902939) (← links)
- Automatic Data-Abstraction in Model Checking Multi-Agent Systems (Q3003426) (← links)
- Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic (Q3003427) (← links)
- Three Steps (Q3092292) (← links)
- (Q3384082) (← links)
- Symbolic Model Checking for Dynamic Epistemic Logic (Q3457719) (← links)
- Information Exchange in the Russian Cards Problem (Q6488451) (← links)