How to parallelize sequential processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1243, Issue , 1997, Pages 302-316

  Kučera, Antonín ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957885780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63141-0_21     Document Type: Conference Paper

References (16)

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 PA RLE'87, volume 259 of LNCS, pages 93-114. Springer-Verlag, 1987.
2. J.C.M. Baeten and W.P. Weijland. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
3. J. Blanco. Normed BPP and BPA. In Proceedings of ACP'94, Workshops in Computing, pages 242-251. Springer-Verlag, 1995.
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.
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.
6. S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, 1993.
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.
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.
9. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. Technical report ECSLFCS- 94-288, Department of Computer Science, University of Edinburgh, 1994.
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.
11. H. Hiittel 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.
12. A. Kučera. How to parallelize sequential processes. Technical report FIMU-RS- 96-05, Faculty of Informatics, Masaryk University, 1996.
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.
14. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
15. R. Milner and F. Moller. Unique decomposition of processes. Theoretical Computer Science, 107(2):357-363, 1993.
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.