Symbolic transition graph with assignment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1119, Issue , 1996, Pages 50-65

  Lin, Huimin ^a  

^a INSTITUTE OF SOFTWARE   (China)

Author keywords

[No Author keywords available]

Indexed keywords

MESSAGE PASSING; SEMANTICS;

BISIMULATIONS; EQUATION SYSTEMS; FINITE STATE; MESSAGE PASSING PROCESS; OPERATIONAL SEMANTICS; SYMBOLIC TRANSITION GRAPHS;

GRAPH ALGORITHMS;

EID: 84955601380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_47     Document Type: Conference Paper

References (13)

1. R. Cleaveland, J. Parrow, and B. Steffen. A semantics based verification tool for finite state systems. In Proceedings of the 9th International Symposium on Protocol Specification, Testing and Verification, North Holland, 1989.
2. 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.
3. 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.
4. J. Godskesen, K. Larsen, and M. Zeeberg. Tav user manual. Report R89-19, Aalborg University, 1989.
5. M. Hennessy and A. Ingolfsdottir. Communicating processes with value-passing and assignment. Formal Aspects of Computing, 3:346-66, 1993.
6. M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353-389, 1995.
7. 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.
8. K.G. Larsen. Efficient local correctness checking. In Computer Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, 1992.
9. X. Liu. Specification and Decomposition in Concurrency. Ph.d. thesis, Aalborg University, 1992.
10. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
11. M.Z. Schreiber. Value-passing Process Calculi as a Formal Method. Ph.D. thesis, Imperial College, 1994.
12. R. De Simone and D. Vergamimi. Aboard auto. Report RT111, INRIA, 1989.
13. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5, 1955.