Author:
Degano Pierpaolo,Gadducci Fabio,Priami Corrado
Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. Process algebra for synchronous communication;Bergstra;Inform. Comput.,1984
2. Computational semantics of term rewriting systems;Boudol,1985
3. A non-interleaving semantics from CCS based on proved transitions;Boudol;Fund. Inform.,1988
4. G. Carabetta, P. Degano, F. Gadducci, CCS semantics via proved transition systems and rewriting logic, in: C. Kirchner, H. Kirchner (Eds.), Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1999. Available at http://www.elsevier.nl/locate/entcs/volume15.html/.
5. CPO models for infinite term rewriting;Corradini,1995
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献