Petri nets, commutative context-free grammars, and basic parallel processes-Reference-Cited by-同舟云学术

Petri nets, commutative context-free grammars, and basic parallel processes

Published:1995 Issue: Volume: Page:221-232
ISSN:0302-9743
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Esparza Javier

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60249-6_54.pdf

Reference15 articles.

1. S. Christensen. Decidability and Decomposition in Process Algebras. Ph.D. Thesis, University of Edinburgh, CST-105-93, (1993).

2. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Proceedings of CONCUR '92, LNCS 630, pp. 138–147 (1992).

3. S. Christensen, Y. Hirshfeld and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. CONCUR '93, LNCS 715, 143–157 (1993).

4. S. Eilenberg and M.P. Schützenberger. Rational sets in commutative monoids. Journal of Algebra 13, 173–191 (1969).

5. J. Esparza and M. Nielsen. Decidability Issues for Petri Nets—a Survey. EATCS Bulletin 52 (1994). Also: Journal of Information Processing and Cybernetics.

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

1. A Decision Procedure for String Logic with Quadratic Equations, Regular Expressions and Length Constraints;Programming Languages and Systems;2018

2. Partially-commutative context-free languages;Electronic Proceedings in Theoretical Computer Science;2012-08-12

3. Decidability of Weak Bisimilarity for a Subset of BPA;Electronic Notes in Theoretical Computer Science;2008-04

4. Deciding Weak Bisimilarity of Normed Context-Free Processes Using Tableau;Theoretical Aspects of Computing – ICTAC 2007;2007

5. P Systems: Some Recent Results and Research Problems;Lecture Notes in Computer Science;2005