Skip to main content
SpringerLink
Log in

Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract)

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1644))

Abstract

We present a procedure for deciding whether two normed PA terms are bisimilar. The procedure is “elementary,” having doubly exponential non-deterministic time complexity.

The first author was supported in part by EPSRC Visiting Research Fellowships GR/K83243 and GR/M06468.

The second author is supported in part by Esprit Working Group No. 21726, “RAND2.”

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C.M. Baeten, J.A. Bergstra and J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, Journal of the ACM 40 (1993), 653–682.

    Article  MathSciNet  Google Scholar 

  2. J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction. Theoretical Computer Science 37 (1985), 77–121.

    Article  MathSciNet  Google Scholar 

  3. Olaf Burkart, Didier Caucal and Bernhard Steffen, An elementary bisimulation decision procedure for arbitrary context-free processes. Proceedings of MFCS’ 95: 20th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 969, Springer-Verlag, 1995, 423–433.

    Google Scholar 

  4. Søren Christensen, Decidability and Decomposition in Process Algebras (PhD. Thesis). Internal Report ECS-LFCS-93-278, Laboratory for Foundations of Computer Science, University of Edinburgh, September 1993.

    Google Scholar 

  5. Søren Christensen, Yoram Hirshfeld, and Faron Moller, Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science (LICS 93), IEEE Computer Society Press, 1993, 386–396.

    Google Scholar 

  6. Søren Christensen, Yoram Hirshfeld, and Faron Moller, Bisimulation equivalence is decidable for basic parallel processes. Proceedings of CONCUR 93: Fourth International Conference on Concurrency Theory, Lecture Notes in Computer Science 715, Springer-Verlag, 1993, 143–157.

    Chapter  Google Scholar 

  7. Søren Christensen, Hans HÜttel and Colin STIRLING, Bisimulation equivalence is decidable for all context-free processes, Information and Computation 121 (1995), 143–148.

    Article  MathSciNet  Google Scholar 

  8. Yoram Hirshfeld and Mark Jerrum, Bisimulation equivalence is decidable for normed Process Algebra, Internal Report ECS-LFCS-98-386, Laboratory for Foundations of Computer Science, University of Edinburgh, May 1998. URL: http://www.dcs.ed.ac.uk/lfcsreps/EXPORT/98/ECS-LFCS-98-386/index.html.

  9. Yoram Hirshfeld, Mark Jerrum and Faron Moller, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Theoretical Computer Science 158 (1996), 143–159.

    Article  MathSciNet  Google Scholar 

  10. Yoram Hirshfeld, Mark Jerrum and Faron Moller, A polynomial algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes, Mathematical Structures in Computer Science 6 (1996), 251–259.

    Article  MathSciNet  Google Scholar 

  11. Antonín KuČera, How to parallelize sequential processes. Proceedings of CONCUR 97: Eighth International Conference on Concurrency Theory, Lecture Notes in Computer Science 1243, Springer-Verlag, 1997, 302–316.

    Chapter  Google Scholar 

  12. Robin Milner, Communication and Concurrency, Prentice Hall, 1989.

    Google Scholar 

  13. Robin Milner and Faron Moller, Unique decomposition of processes, Theoretical Computer Science 107 (1993), 357–363.

    Article  MathSciNet  Google Scholar 

  14. D.M.R. Park, Concurrency and Automata on Infinite Sequences. Theoretical Computer Science: Fifth GI-Conference, Lecture Notes in Computer Science104, Springer-Verlag, 1981, 167–183.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Ramat Aviv, Tel Aviv, 69978, Israel

    Yoram Hirshfeld

  2. Department of Computer Science, University of Edinburgh, The King’s Buildings, Edinburgh, EH9 3JZ, UK

    Mark Jerrum

Authors
  1. Yoram Hirshfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark Jerrum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Academy of Sciences of the Czech Republic, Pod vodarenskou vezi 2, 182 07, Prague 8 - Liben, Czech Republic

    Jirí Wiedermann

  2. ILLC-WINS-University of Amsterdam, Plantage Muidergracht 24, 1018, TV, Amsterdam, The Netherlands

    Peter van Emde Boas

  3. BRICS, Department of Computer Science, University of Aarhus, Ny Munkegade, Bldg. 540, DK, 8000, Aarhus C, Denmark

    Mogens Nielsen

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirshfeld, Y., Jerrum, M. (1999). Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract). In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-48523-6_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66224-2

  • Online ISBN: 978-3-540-48523-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation