Advertisement
Published in:
2011 | OriginalPaper | Chapter
STGRs over Topological Spaces for Value-Passing Processes
Author : Huanbao Wang
Published in: Informatics in Control, Automation and Robotics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.