Author:
Burkart Olaf,Caucal Didier,Steffen Bernhard
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages. In PARLE '87, LNCS 259, pages 94–113. Springer, 1987. Full version appeared as: Technical Report CS-R8632, CWI, Sep. 1987.
2. O. Burkart, D. Caucal, and S. Steffen. An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes. Technical Report AIB-94-28, RWTH Aachen, 1994.
3. J.C.M. Baeten and W.P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in TCS. Cambridge University Press, 1990.
4. D. Caucal. A Fast Algorithm to Decide on Simple Grammars Equivalence. In Int. Symposium on Optimal Algorithms, LNCS 401, pages 66–85. Springer, 1989.
5. D. Caucal. Graphes Canoniques de Graphes Algébriques. RAIRO, 24(4):339–352, 1990. A preliminary, version appeared as: Rapport de Recherche 872, INRIA, July 1988.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. System $$F^\mu _\omega $$ with Context-free Session Types;Programming Languages and Systems;2023
2. Higher-order Context-free Session Types in System F;Electronic Proceedings in Theoretical Computer Science;2022-03-24
3. The parametric complexity of bisimulation equivalence of normed pushdown automata;Frontiers of Computer Science;2021-12-03
4. Never-Stop Context-Free Learning;Model Checking, Synthesis, and Learning;2021
5. Deciding the Bisimilarity of Context-Free Session Types;Tools and Algorithms for the Construction and Analysis of Systems;2020