Skip to main content
SpringerLink
Log in

How to Parallelize sequential processes

  • Contributions
  • Conference paper
  • First Online:
CONCUR '97: Concurrency Theory (CONCUR 1997)

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

Included in the following conference series:

Abstract

A process is prime if it cannot be decomposed into a parallel product of nontrivial processes. We characterize all non-prime normed BPA processes together with their decompositions by means of normal forms which are designed in this paper. Using this result we demonstrate decidability of the problem whether a given normed BPA process is prime; moreover, we show that non-prime normed BPA processes can be decomposed into primes effectively. This brings other positive decidability results. Finally, we prove that bisimilarity is decidable in a large subclass of normed PA processes.

supported by GA ČR, grant number 201/97/0456

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

Access this chapter

Log in via an institution

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. In Proceedings of PARLE'87, volume 259 of LNCS, pages 93–114. Springer-Verlag, 1987.

    Google Scholar 

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

    Google Scholar 

  3. J. Blanco. Normed BPP and BPA. In Proceedings of ACP'94, Workshops in Computing, pages 242–251. Springer-Verlag, 1995.

    Google Scholar 

  4. O. Burkart and B. Steffen. Pushdown processes: Parallel composition and model checking. In Proceedings of CONCUR'94, volume 836 of LNCS, pages 98–113. Springer-Verlag, 1994.

    Google Scholar 

  5. I. Černá, M. Křetínský, and A. Kučera. Bisimilarity is decidable in the union of normed BPA and normed BPP processes. In Proceedings of INFINITY'96, MIP-9614, pages 32–46. University of Passau, 1996.

    Google Scholar 

  6. S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, 1993.

    Google Scholar 

  7. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for all basic parallel processes. In Proceedings of CONCUR'93, volume 715 of LNCS, pages 143–157. Springer-Verlag, 1993.

    Google Scholar 

  8. S. Christensen, Y. Hirshfeld, and F. Moller. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. In Proceedings of LICS'93. IEEE Computer Society Press, 1993.

    Google Scholar 

  9. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. Technical report ECS-LFCS-94-288, Department of Computer Science, University of Edinburgh, 1994.

    Google Scholar 

  10. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial-time algorithm for deciding equivalence of normed context-free processes. In Proceedings of 35th Annual Symposium on Foundations of Computer Science, pages 623–631. IEEE Computer Society Press, 1994.

    Google Scholar 

  11. H. Hüttel and C. Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. In Proceedings of LICS'91, pages 376–386. IEEE Computer Society Press, 1991.

    Google Scholar 

  12. A. Kučera. How to parallelize sequential processes. Technical report FIMU-RS-96-05, Faculty of Informatics, Masaryk University, 1996.

    Google Scholar 

  13. A. Kučera. Regularity is decidable for normed BPA and normed BPP processes in polynomial time. In Proceedings of SOFSEM'96, volume 1175 of LNCS, pages 377–384. Springer-Verlag, 1996.

    Google Scholar 

  14. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  15. R. Milner and F. Moller. Unique decomposition of processes. Theoretical Computer Science, 107(2):357–363, 1993.

    Google Scholar 

  16. D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, volume 104 of LNCS, pages 167–183. Springer-Verlag, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic

    Antonín Kučera

Authors
  1. Antonín Kučera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz Józef Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kučera, A. (1997). How to Parallelize sequential processes. In: Mazurkiewicz, A., Winkowski, J. (eds) CONCUR '97: Concurrency Theory. CONCUR 1997. Lecture Notes in Computer Science, vol 1243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63141-0_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-63141-0_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69188-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation