Skip to main content
Conference Proceedings

Deciding properties of contract-signing protocols

Lecture Notes in Computer Science (2005) 3404 158-169
DOI: 10.1007/978-3-540-31856-9_13
11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that for infinite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style certain fundamental branching properties are decidable. As a consequence, we obtain that crucial properties of contract-signing protocols such as balance are decidable. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Kähler, D., Küsters, R., & Wilke, T. (2005). Deciding properties of contract-signing protocols. In Lecture Notes in Computer Science (Vol. 3404, pp. 158–169). Springer Verlag. https://doi.org/10.1007/978-3-540-31856-9_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free