Skip to main content
SpringerLink
Log in

Regularity of BPA-Systems is Decidable

  • Conference paper
CONCUR ’94: Concurrency Theory (CONCUR 1994)

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

Included in the following conference series:

Abstract

It is decidable whether a system in Basic Process Algebra (BPA) is regular with respect to bisimulation semantics. Basic operators in BPA are alternative composition, sequential composition and guarded recursion. A system is regular if the interpretations of all process variables defined in the system have finitely many states. We present an effective method to transform a BPA specification into a linear specification whenever possible.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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 & J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, Proc. PARLE 87, (J.W. de Bakker, A.J. Nijman, P.C. Treleaven, Eds.), LNCS 259, pp. 93–114, 1987.

    Google Scholar 

  2. J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.

    Google Scholar 

  3. J.A. Bergstra & J.W. Klop, Process theory based on bisimulation semantics, Linear time, branching time and partial order in logics and models for concurrency, (J.W. de Bakker, W.P. de Roever, G. Rozenberg, Eds.), LNCS 354, pp. 50–122, 1989.

    Google Scholar 

  4. S. Christensen, H. Hüttel & C. Stirling, Bisimulation equivalence is decidable for all context-free processes, Proc. CONCUR’92, (W.R. Cleaveland, ed.), LNCS 630, pp. 138–147, 1992.

    Google Scholar 

  5. S. Christensen, Y. Hirschfeld & F. Moller, Bisimulation equivalence is decidable for basic parallel processes, Proc. CONCUR’93, (E. Best, ed.), LNCS 715, pp. 143–157, 1993.

    Google Scholar 

  6. S. Mauw & G.J. Veltink, A process specification formalism, Fundamenta Informaticw XIII, pp. 85–139, 1990.

    Google Scholar 

  7. S. Mauw & G.J. Veltink, Algebraic specification of communication protocols, Cambridge Tracts in Theoretical Computer Science 36, Cambridge University Press, 1993.

    Google Scholar 

  8. R. Milner, A complete inference system for a class of regular behaviours, JCSS 28, pp. 439–466, 1984.

    MATH  MathSciNet  Google Scholar 

  9. D.M.R. Park, Concurrency and automata on infinite sequences, Proc. 5th GI Conf. (P. Duessen, ed.), LNCS 104, pp. 167–183, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Sjouke Mauw & Hans Mulder

Authors
  1. Sjouke Mauw
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans Mulder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Systems, Uppsala University, P.O. Box 325, S-751 05, Uppsala, Sweden

    Bengt Jonsson

  2. Swedish Institute of Computer Science, P.O. Box 1262, S-164 28, Kista, Sweden

    Joachim Parrow

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mauw, S., Mulder, H. (1994). Regularity of BPA-Systems is Decidable. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48654-1_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58329-5

  • Online ISBN: 978-3-540-48654-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation