Abstract
In this paper we introduce a variant of symbolic transition graphs over topological spaces for value-passing processes based on CCS with infinite assignments, namely, a symbolic transition graph with a binary equivalence relation, which is abbreviated to STGR. It relies on topological spaces for value-passing processes, which is different from the original STG. These results apply to partition domains of conversations of cryptographic protocols that run in an infinite concurrent way. We work out a highly efficient solution to reduce computational complexities to prove safety properties of cryptographic protocols running in an infinite concurrent way. Our STGR can be also used to describe ordinary concurrent systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Milner, R.: The Space and Motion of Communicating Agents. Cambridge University Press (2009)
Milner, R.: Communicating and Mobile Systems: the π-Calculus. Computer Laboratory, Cambridge University Press, University of Cambridge (1999)
Crazzolara, F., Winskel, G.: Composing Strand Spaces. BRICS Report Series RS-02-5 (2002)
Hennessy, M., Lin, H.: Symbolic Bisimulations. Theoretical Computer Science 138, 353–389 (1995)
Wang, H., Zhang, Y., Li, Y.: A Diagram of Strand Spaces for Security Protocols. Journal of Computer Research and Development 43(12), 2062–2068 (2006)
Wang, H., Zhang, Y., Li, Y.: Modeling for Security Verification of a Cryptographic Protocol with MAC Payload. In: Huang, D.-S., Zhang, X.-P., Huang, G.-B. (eds.) ICIC 2005. LNCS, vol. 3645, pp. 538–547. Springer, Heidelberg (2005)
Crazzolara, F., Winskel, G.: Events in Security Protocols. In: Proc. of the 8th ACM Conference on Computer and Communications Security, ACM Press, Philadelphia (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, H. (2011). STGRs over Topological Spaces for Value-Passing Processes. In: Tan, H. (eds) Informatics in Control, Automation and Robotics. Lecture Notes in Electrical Engineering, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25899-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-25899-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25898-5
Online ISBN: 978-3-642-25899-2
eBook Packages: EngineeringEngineering (R0)