Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes-Reference-Cited by-同舟云学术

Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes

Published:2013-09-29 Issue:1 Volume:55 Page:136-169
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Czerwiński Wojciech,Hofman Piotr,Lasota Sławomir

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00224-013-9505-9/fulltext.html

Reference19 articles.

1. Christensen, S.: Decidability and decomposition in process algebras. Ph.D. thesis, Dept. of Computer Science, University of Edinburgh, UK (1993)

2. Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation equivalence is decidable for basic parallel processes. In: CONCUR, pp. 143–157 (1993)

3. Czerwinski, W., Hofman, P., Lasota, S.: Decidability of branching bisimulation on normed commutative context-free processes. In: CONCUR, pp. 528–542 (2011)

4. Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundam. Inform. 31(1), 13–25 (1997)

5. Fröschle, S., Lasota, S.: Normed processes, unique decomposition, and complexity of bisimulation equivalences. Electron. Notes Theor. Comput. Sci. 239, 17–42 (2009)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bisimilarity on Basic Parallel Processes;Theoretical Computer Science;2022-02

2. BRANCHING BISIMILARITY OF NORMED BPA PROCESSES AS A RATIONAL MONOID;LOG METH COMPUT SCI;2017

3. Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07