Abstract
We introduce an improved version of the symbolic transition graph with assignment (STGA) of Lin. The distinction of our model is that the assignment of a transition is performed after rather than before the action. Consequently, it has two advantages over the original one: on one hand, most regular value-passing processes can be represented more intuitively and compactly as such graphs; on the other hand, the natural definitions of symbolic double transitions can be given. The rules which generate the improved STGAs from regular value-passing processes are presented. The various versions (late/early, ground/symbolic) of strong operational semantics and strong bisimulation are given to such graphs, respectively. Our strong bisimulation algorithms are based on the late strong bisimulation algorithm of Lin, however, ours are more concise and practical. Finally, the improved STGAs are generalized to both symbolic observation graphs with assignments and symbolic congruence graphs with assignments, and therefore weak bisimulation equivalence and observation congruence can be checked, respectively.
This work is partially supported by 863 Hi Tech Project and NNSF of China.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. Bruns. Distributed System Analysis with CCS. Prentice Hall,1996.
R. Cleaveland, J. Parrow and B. Steffen. The concurrency workbench: A semantics based verification tool for the verification of concurrent systems. ACM Transactions on Programming Language and Systems, Vol.15, No.1, pages 36–72, 1993.
J. Godskesen, K. Larsen and M. Zeeberg. Tav user manual. Report R89-19, Aalborg University, 1989.
M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353–389, 1995.
M. Hennessy and H. Lin. Proof systems for message-passing process algebras. Formal Aspects of Computing, No 3, 1996.
B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. Information and computation, 107: 272–302, 1993.
K. G. Larsen.Efficient local correctness checking. In CAV’92, LNCS. Springer-Verlag, 1992.
Z. J. Li. Checking weak bisimulation equivalence and observation congruence for value-passing processes with finite symbolic transiton graphs. Technical report 6/97, Changsha Institute of Technology, 1997.
Z. J. Li and H. W. Chen. Checking strong/weak bisimulation equivalences and observation congruence for the π-calculus. In ICALP’98, LNCS 1443. Springer-Verlag, 1998.
H. Lin. Symbolic transition graph with assignment. In CONCUR’96, LNCS 1119. Springer-Verlag, 1996.
X. Liu. Specification and decomposition in concurrency. Ph.D.thesis, Aalborg University, 1992.
R. Milner. Communication and Concurrency. Prentice-Hall,1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Z., Chen, H. (1999). Computing Strong/Weak Bisimulation Equivalences and Observation Congruence for Value-Passing Processes. In: Cleaveland, W.R. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 1999. Lecture Notes in Computer Science, vol 1579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49059-0_21
Download citation
DOI: https://doi.org/10.1007/3-540-49059-0_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65703-3
Online ISBN: 978-3-540-49059-3
eBook Packages: Springer Book Archive