Deciding bisimulation and trace equivalences for systems with many identical processes

  • Hsu-Chun Yen
  • Shi-Tsuen Jian
  • Ta-Pang Lao
Session 8
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1004)


In this paper, we study the complexity and decidability issues of checking trace and bisimulation equivalences for the model of systems with many identical processes with respect to various interprocess communication structures. In our model, each system consists of an arbitrary number of identical finite state processes using Milner's Calculus of Communicating Systems (CCS) as the style of interprocess communication. As it turns out, checking trace and bisimulation equivalences are undecidable for star-like and linear systems, whereas the two problems are complete for PSPACE and PTIME, respectively, for fully connected systems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Christensen, S. and Hüttel, H. Decidability issues for infinite-state processes — a survey. EATCS Bulletin 51, pp. 156–166, (1993).Google Scholar
  2. 2.
    Clark, E., Grümberg, O. and Browne, M. Reasoning about networks with many identical finite-state processes. PODC'86, pp. 240–248, (1986).Google Scholar
  3. 3.
    Garg, V. Analysis of distributed systems with many identical processes. IEEE Int. Conf. on Distributed Computing Systems, pp. 358–365, (1988).Google Scholar
  4. 4.
    German, S. and Sistla, A. Reasoning about systems with many processes. JACM 39, 675–735, (1992).Google Scholar
  5. 5.
    Girkar, M. and Moll, R. Undecidability of bisimulations in concurrent systems with indefinite number of identical processes. Dept. of Computer Science, Univ. of Massachusetts, CMPSCI Technical Report 93-86, December 1993.Google Scholar
  6. 6.
    Girkar, M. and Moll, R. New results on the analysis of concurrent systems with an indefinite number of processes. CONCUR'94, (1994).Google Scholar
  7. 7.
    Hirshfeld, Y. Petri nets and the equivalence problem. CSL, (1993).Google Scholar
  8. 8.
    Hüttel, H. Undecidable equivalences for basic parallel processes. 13th FST&TCS, pp. 454–464, (1993).Google Scholar
  9. 9.
    Jančar, P. Decidability questions for bisimilarity of Petri nets and some related problems. STACS'94, LNCS 755, pp. 581–592, (1994).Google Scholar
  10. 10.
    Kanellakis, P. and Smolka, S. On the analysis of cooperation and antagonism in networks of communicating processes, Algorithmica 3, pp. 421–450, (1988).Google Scholar
  11. 11.
    Kanellakis, P. and Smolka, S. CCS expression, finite state processes, and three problems of equivalence. Information and Computation 86, pp. 43–68, (1990).Google Scholar
  12. 12.
    Sistla, A. and German, S. Reasoning with many processes. LICS'87, pp. 138–152, (1987).Google Scholar
  13. 13.
    van Glabbeek, R. The linear time-branching time spectrum. CONCUR'90, LNCS 458, pp. 278–297, (1990).Google Scholar
  14. 14.
    Yen, H. Priority systems with many identical processes. Acta Informatica 28, pp. 681–692 (1991).Google Scholar
  15. 15.
    Yen, H., Jian, S., and Lao, T. Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes. Tech. Report, Dept. of Electrical Engineering, National Taiwan Univ., 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Hsu-Chun Yen
    • 1
  • Shi-Tsuen Jian
    • 1
  • Ta-Pang Lao
    • 1
  1. 1.Dept. of Electrical EngineeringNational Taiwan UniversityTaipeiTaiwan, R. O. C.

Personalised recommendations