Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-26T07:57:53.505Z Has data issue: false hasContentIssue false
  • English
  • Français

A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes

Published online by Cambridge University Press:  04 March 2009

Yoram Hirshfeld ,
Mark Jerrum  and
Faron Moller
Yoram Hirshfeld
Affiliation:
School of Mathematics and Computer Science, Tel Aviv University, Israel
Mark Jerrum
Affiliation:
Department of Computer Science, University of Edinburgh, United Kingdom
Faron Moller
Affiliation:
Swedish Institute of Computer Science, Kista, Sweden
Get access Rights & Permissions [Opens in a new window]

Abstract

A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commutative parallel-composition operator.

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 6 , Issue 3 , June 1996 , pp. 251 - 259
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Baeten, J. C. M., Bergstra, J.A. and Klop, J.W. (1993) Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM 40 (3) 653–682.CrossRefGoogle Scholar
Bergstra, J.A. and Klop, J.W. (1985) Algebra of Communicating Processes with Abstraction. Theoretical Computer Science 37 (1) 77–121.CrossRefGoogle Scholar
Christensen, S., Hirshfeld, Y. and Moller, F. (1993a) Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. In: Proceedings of the Eighth Symposium on Logic in Computer Science, IEEE Computer Society Press 386–396.Google Scholar
Christensen, S., Hirshfeld, Y. and Moller, F. (1993b) Bisimulation equivalence is decidable for basic parallel processes. In Best, E. (ed.) Proceedings of CONCUR 93. Springer-Verlag Lecture Notes in Computer Science 715 143–157.CrossRefGoogle Scholar
Christensen, S., Hüttel, H. and Stirling, C. (1992) Bisimulation equivalence is decidable for all context-free processes. In: Cleaveland, W. R. (ed.) Proceedings of CONCUR 92. Springer-Verlag Lecture Notes in Computer Science 630 138–147.CrossRefGoogle Scholar
Groote, J. F. (1991) A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters 42 167–171.CrossRefGoogle Scholar
Hirshfeld, Y. (1994) Petri nets and the equivalence problem. In Börger, E., Gurevich, Y. and Meinke, K. (eds.) Proceedings of CSL ‘93. Springer-Verlag Lecture Notes in Computer Science 832 165–174.CrossRefGoogle Scholar
Hirshfeld, Y., Jerrum, M. and Moller, F. (1994) A polynomial algorithm for deciding bisimilarity of normed context-free processes, Report ECS-LFCS- 94–286., Department of Computer Science. University of Edinburgh. (To appear in Theoretical Computer Science.)Google Scholar
Hopcroft, J. E. and Ullman, J. D. (1979) Introduction to Automata Theory, Languages, and Computation, Addison Wesley.Google Scholar
Hüttel, H. and Stirling, C. (1991) Actions speak louder than words: proving bisimilarity for contextfree processes. In: Proceedings of the Sixth Symposium on Logic in Computer Science, IEEE Computer Society Press 376–386.Google Scholar
Huynh, D. T. and Tian, L. (1994) Deciding bisimilarity of normed context-free processes is in Σp2 Journal of Theoretical Computer Science 123 183–197.CrossRefGoogle Scholar
Milner, R. (1989) Communication and Concurrency, Prentice Hall.Google Scholar
Milner, R. and Moller, F. (1993) Unique decomposition of processes. Journal of Theoretical Computer Science 107 357–363.CrossRefGoogle Scholar
Park, D.M.R. (1981) Concurrency and Automata on Infinite Sequences. Springer-Verlag Lecture Notes in Computer Science 104 168–183.Google Scholar