Abstract
A new model for message-passing processes is proposed which generalizes the notion of symbolic transition graph as introduced in [HL95], by allowing assignments to be carried in transitions. The main advantage of this generalization is that a wider class of processes can be represented as finite state graphs. Two kinds of operational semantics, ground and symbolic, are given to such graphs. On top of them both ground and symbolic bisimulations are defined and are shown to agree with each other. An algorithm is also presented which computes bisimulation formulae for finite state symbolic transition graphs with assignments, in terms of the greatest solutions of predicate equation systems.
Supported by grants from the President Fund of Chinese Academy of Sciences, the National Science Foundation of China, and EU KIT 119 project SYMSEM.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Cleaveland, J. Parrow, and B. Steffen. A semantics based verification tool for finite state systems. In Proceedings of the 9 th International Symposium on Protocol Specification, Testing and Verification, North Holland, 1989.
R. Cleaveland and J. Riely. Testing-based abstractions for valuepassing systems. In CONCUR'94, number 836 in Lecture Notes in Computer Science, pages 417–432. Springer-Verlag, 1994.
W. Damn, H. Hungar, and O. Grumberg. What if model checking must be truly symbolic? In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, 1995. Aarhus, Denmark.
J. Godskesen, K. Larsen, and M. Zeeberg. Tav user manual. Report R89-19, Aalborg University, 1989.
M. Hennessy and A. Ingolfsdottir. Communicating processes with value-passing and assignment. Formal Aspects of Computing, 3:346–366, 1993.
M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353–389, 1995.
B. Jonsson and J. Parrow. Deciding bisimulation equivalences for a class of non-finite-state programs. Information and Computation, 1992. to appear. Also available as SICS research Report R-89/8908.
K.G. Larsen. Efficient local correctness checking. In Computer Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, 1992.
X. Liu. Specification and Decomposition in Concurrency. Ph.d. thesis, Aalborg University, 1992.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
M.Z. Schreiber. Value-passing Process Calculi as a Formal Method. Ph.D. thesis, Imperial College, 1994.
R. De Simone and D. Vergamimi. Aboard auto. Report RT111, INRIA, 1989.
A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5, 1955.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, H. (1996). Symbolic transition graph with assignment. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_47
Download citation
DOI: https://doi.org/10.1007/3-540-61604-7_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61604-7
Online ISBN: 978-3-540-70625-0
eBook Packages: Springer Book Archive