Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Bergsta, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 545–623. Elsevier Science, Amsterdam (2001)
2. Mayr, R.: Process rewrite systems. Inf. Comput. 156, 264–286 (2000)
3. Srba, J.: Roadmap of infinite results. Bulletin of the EATCS 78, 163–175 (2002)
4. Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for processes generating context-free languages. J. ACM 40, 653–682 (1993)
5. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computations. Addison-Wesley, Reading (1979)