Decidability results in automata and process theory

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

Volumn 1043, Issue , 1996, Pages 102-148

  Hirshfeld, Yoram ^a   Moller, Faron ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003733777     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60915-6_4     Document Type: Conference Paper

References (54)

1. P. Aczel. Non-well-founded Sets. CSLI Lecture Notes 14, Stanford University, 1988.
2. 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, pp653-682, 1993.
3. Y. Bar-Hillel, M. Perles and E. Shamir. On formal properties of simple phrase structure grammars. Zeitschrifl fiir Phonetik, Sprachwissenschafl, und Kommunikationsforschung 14, pp143-177, 1961.
4. J.A. Bergstra and J.W. Klop. Algebra of Communicating Processes with Abstraction. Theoretical Computer Science 37, pp77-121, 1985.
5. G. Boudol. Notes on algebraic calculi of processes. In K. Apt (ed), Logics and Models of Concurrent Systems, NATO ASI Series f13, 1985.
6. J.C. Bradfield. Verifying Temporal Properties of Systems. Birkh/iuser, 1991. E. Brinksma. Information Processing Systems - Open Systems Interconnection - LOTOS - A formal description technique based upon the temporal ordering of observable behaviouL Draft International Standard ISO8807, 1988.
7. S.D. Brookes, C.A.R. Hoare and A.W. Roscoe. A theory of Communicating Sequential Processes. Journal of the ACM 31, pp560-599, 1984.
8. O. Burkart and B. Steffen. Model checking for context-free processes. In Proceedings of CONCUR 92, W.R. Cleaveland (ed), Lecture Notes in Computer Science 630, pp123-137. Springer-Verlag, 1992.
9. D. Caucal. Graphes canoniques des graphes algébriques. Informatique Thdorique el Applications (RAIRO) 24(4), pp339-352, 1990.
10. D. Caucal. A fast algorithm to decide on the equivalence of stateless DPDA. Informatique Thdorique et Applications (RAIRO) 27(1), pp23-48, 1993.
11. S. Christensen. Decidability and Decomposition in Process Algebras. Ph.D. Thesis ECS-LFCS-93-278, Department of Computer Science, University of Edinburgh, 1993.
12. S. Christensen. Distributed bisimilarity is decidable for a class of infinitestate processes. In Proceedings of CONCUR 92, W.R. Cleaveland (ed), Lecture Notes in Computer Science 630, pp148-161. Springer-Verlag, 1992.
13. S. Christensen, Y. Itirshfeld and F. Moller. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. In Proceedings of LICS93. IEEE Computer Society Press, 1993.
14. S. Christensen, Y. Hirshfeld and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. In proceedings of CONCUR93, E. Best (ed), Lecture Notes in Computer Science 715, pp143-157, Springer-Verlag, 1993.
15. S. Christensen, Y. Hirshfeld and F. Moller. Decidable subsets of CCS. The Computer Journal 37(4), pp233-242, 1994.
16. S. Christensen and H. Hiittel. Decidability issues for infinite-state processes - a survey. Bulletin of the EATCS 51, pp156-166, October 1993.
17. S. Christensen, H. Hiittel and C. Stifling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR 92, W.R. Cleaveland (ed), Lecture Notes in Computer Science 630, pp138-147. Springer-Verlag, 1992.
18. J. Esparza and M. Nielsen. Decidability issues for Petri nets - a survey. Bulletin of the EATCS 52, pp245-262, February 1994.
19. E.P. Friedman. The inclusion problem for simple languages. Theoretical Computer Science 1, pp297-316, 1976.
20. R.J. van Glabbeek. The linear time-branching time spectrum. In Proceedings of CONCUR 90, J. Baeten, J.W. Klop (eds), Lecture Notes in Computer Science 458, pp278-297. Springer-Verlag, 1990.
21. J.F. Groote. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters 42, pp167-171, 1991.
22. J.F. Groote and H. Hiittel. Undecidable equivalences for basic process algebra. Information and Computation, 1994.
23. J.F. Groote and F. Moller. Verification of parallel systems via decomposition. In Proceedings of CONCUR 92, W.R. Cleaveland (ed), Lecture Notes in Computer Science 630, pp62-76. Springer-Verlag, 1992.
24. Y. Hirshfeld. Petri Nets and the Equivalence Problem. In Proceedings of CSL'93, K. Meinke (ed), Lecture Notes in Computer Science Springer-Verlag, 1994.
25. Y. Hirshfeld. Deciding equivalences in simple process algebras. In Proceedings of a 3-day Workshop on Bisimulation, Amsterdam, April, 1994.
26. Y. I'Iirshfeld, M. Jerrum and F. Moller, A polynomial algorithm for deciding bisimilarity of normed context-free processes. Submitted to Theoretical Computer Science, 1994.
27. Y. Hirshfeld, M. Jerrum and F. Moiler, A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. Submitted to Mathematical Structures in Computer Science, 1994.
28. Y. Hirshfeld and F. Moller. A fast algorithm for deciding bisimilarity of normed context-free processes. In Proceedings of CONCUR'94, J. Parrow (ed), Lecture Notes in Computer Science. Springer-Verlag, 1994.
29. M. Hennessy. Algebraic Theory of Processes. MIT Press, 1989.
30. C.A.R. Hoare. Communicating Sequential Processes. Communications of the ACM 21, pp666-677, 1978.
31. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1988.
32. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 1979.
33. It. Hfittel. Decidability, Behavioural Equivalences and Infinite Transition Graphs. Ph.D. Thesis ECS-LFCS-91-191, Department of Computer Science, University of Edinburgh, 1991.
34. H. Hfittel. Undecidable equivalences for basic parallel processes. In Proceedings of FSTTCS'93, 1993.
35. H. Hfittel and C. Stirling. Actions speak louder than words: proving bisimilarity for context-free processes. In Proceedings of LICS'91, IEEE Computer Society Press, pp376-386, 1991.
36. D.T. Huynh and L. Tian. On deciding readiness and failure equivalences for processes. Technical report UTDCS-31-90, Department of Computer Science, University of Texas at Dallas, September 1990.
37. 2. Theoretical Computer Science 123, pp183-197, 1994.
38. D.T. Huynh and L. Tian. On deciding some equivalences for concurrent processes. Informatique Th oriqué et Applications (RAIRO) 28(1), pp51-71, 1994.
39. P. JanSar. Decidability questions for bisimilarity of Petri nets and some related problems. In Proceedings of STACS'94, P. Enjalbert, E.W. Mayr and K.W. Wagner (eds), Lecture Notes in Computer Science 775, pp581-592, Springer-Verlag, 1994.
40. P.C. Kanellakis and S.A. Smolka. CCS expressions, finite-state processes and three problems of equivalence. Information and Computation (86), pp43-68, 1990.
41. S.C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pp3-42, Princeton University Press, Princeton, 1956
42. D.E. Knuth, J.H. Morris, and V.R. Pratt, Fast pattern matching in strings, SIAM Journal on Computing 6, pp323-350, 1977.
43. A. Korenjak and J. Hopcroft. Simple deterministic languages. In Proceedings of 7th IEEE Switching and Automata Theory conference, pp36-46, 1966.
44. W.S. McCullock and W. Pitts A logical calculus of the ideas immanent in nervous activity. Bull Math Biophysics 5, pp115-133, 1943.
45. R. Milner. Processes: a mathematical model of computing agents. In Proceedings of Logic Colloquium'73, Rose and Shepherdson (eds), pp157-174, North Holland, 1973.
46. R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer-Verlag, 1980.
47. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
48. R. Milner and F. Moller.. Unique decomposition of processes. Theoretical Computer Science 107, pp357-363, 1993.
49. E.F. Moore. Gedanken experiments on sequential machines. In Automata Studies, pp129-153, Princeton University Press, Princeton, 1956
50. D. Muller and P. Schupp. The theory of ends, pushdown automata and second order logic. Theoretical Computer Science 37, pp51-75, 1985.
51. R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing 16, pp937-989, 1987.
52. D.M.R. Park. Concurrency and Automata on Infinite Sequences. Lecture Notes in Computer Science 104, pp168-183, Springer Verlag, 1981.
53. W. Reisig. Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.
54. L.J. Stockmeyer. The polynomial time hierarchy. Theoretical Computer Science 3, ppl-22, 1977.