Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Lect Notes Comput Sci;J.-C. Fernandez,1991
2. D. Hirschkoff. Automatically Proving Up To Bisimulation. In Proceedings of MFCS’98 Workshop on Concurrency, volume 18 of ENTCS, 1998.
3. B. Mammas. Une mtéthodologie de preuves orientée contraintes et basée sur les systèmes de transitions modales. Technical report, LIP6, UPMC, 1998.
4. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, October 1991.
5. U. Nestmann. What is a ‘good’ encoding of guarded choice? In Proceedings of EXPRESS’97, volume 7 of ENTCS, 1997.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques;Lecture Notes in Computer Science;2010
2. From Active Names to π-calculus Rewriting Rules;Electronic Notes in Theoretical Computer Science;2005-05
3. Model Checking for Nominal Calculi;Foundations of Software Science and Computational Structures;2005
4. A Study On The Potential Active Names of π-Agents;Electronic Notes in Theoretical Computer Science;2004-05