On the Expressive Power of Restriction and Priorities in CCS with Replication-Reference-Cited by-同舟云学术

On the Expressive Power of Restriction and Priorities in CCS with Replication

Published:2009 Issue: Volume: Page:242-256
ISSN:0302-9743
Container-title:Foundations of Software Science and Computational Structures
language:
Short-container-title:

Author:

Aranda Jesús,Valencia Frank D.,Versari Cristian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-00596-1_18

Reference20 articles.

1. Amadio, R., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous π−calculus. Nordic Journal of Computing 9(2) (2002)

2. Lecture Notes in Computer Science;J. Aranda,2007

3. Aranda, J., Valencia, F., Versari, C.: On the expressive power of restriction and priorities in ccs with replication. Technical report, l’École Polytechnique (2008), http://www.lix.polytechnique.fr/Labo/Jesus.Aranda/publications/trccs.pdf

4. Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for processes generating context-free languages. J. ACM 40(3), 653–682 (1993)

5. Borger, E., Gradel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1994)

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

1. Encoding Petri Nets into CCS;Lecture Notes in Computer Science;2024

2. Language representability of finite place/transition Petri nets;Vietnam Journal of Computer Science;2015-10-24

3. When to Move to Transfer Nets;Programming Languages with Applications to Biology and Security;2015

4. Decidability of Behavioral Equivalences in Process Calculi with Name Scoping;Fundamentals of Software Engineering;2012

5. The Decidability of the Reachability Problem for CCS!;CONCUR 2011 – Concurrency Theory;2011