Partially-commutative context-free processes: Expressibility and tractability-Reference-Cited by-同舟云学术

Partially-commutative context-free processes: Expressibility and tractability

Published:2011-05 Issue:5 Volume:209 Page:782-798
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Czerwiński Wojciech,Fröschle Sibylle,Lasota Sławomir

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference15 articles.

1. Algebra of communicating processes with abstraction;Bergstra;Theoret. Comput. Sci.,1985

2. Verification of infinite structures;Burkart,2001

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

4. Bisimulation equivalence is decidable for all context-free processes;Christensen;Inf. Comput.,1995

5. W. Czerwiński, S. Fröschle, S. Lasota, Partially-commutative context-free processes, in: Proc. CONCUR’09, LNCS, vol. 5710, Springer-Verlag, 2009, pp. 259–273.

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

1. Reachability Problem for Weak Multi-Pushdown Automata;Logical Methods in Computer Science;2013-09-11

2. A Hierarchy of Languages with Catenation and Shuffle;Fundamenta Informaticae;2013

3. Complexity of Checking Bisimilarity between Sequential and Parallel Processes;Mathematical Foundations of Computer Science 2013;2013

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

5. Reachability Problem for Weak Multi-Pushdown Automata;Lecture Notes in Computer Science;2012