Author:
Brázdil Tomáš,Esparza Javier,Kiefer Stefan,Luttenberger Michael
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference38 articles.
1. A polynomial algorithm for deciding bisimilarity of normed context-free processes;Hirshfeld;Theoret. Comput. Sci.,1996
2. Undecidable equivalences for basic parallel processes;Hüttel;Inform. and Comput.,2009
3. Non-interleaving bisimulation equivalences on basic parallel processes;Fröschle;Inform. and Comput.,2010
4. J. Esparza, A. Kučera, R. Mayr, Quantitative analysis of probabilistic pushdown automata: Expectations and variances, in: LICS 2005, IEEE, 2005, pp. 117–126.
5. Randomized parallel algorithms for backtrack search and branch-and-bound computation;Karp;J. ACM,1993
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Analysis of Probabilistic Basic Parallel Processes;Lecture Notes in Computer Science;2014
2. A Brief History of Strahler Numbers;Language and Automata Theory and Applications;2014