| G. Carabetta, P. Degano, and F. Gadducci. CCS semantics via proved transition systems and rewriting logic. In Kirchner and Kirchner [47], pages 253--272. |
....in structural operational semantics for process algebras it is essential for the transitions to have some labelling information that provides the mechanism for synchronization. How to solve these details in the particular case of Milner s CCS [12] was already shown in [10] Moreover, the papers [4,8] showed the good properties of this semantic mapping for CCS. With the availability of the rst release of the Maude system in 1999 [6] we undertook the project of carefully implementing in a fully executable way the CCS operational semantics in order to practically assess the ideas summarized ....
G. Carabetta, P. Degano, and F. Gadducci. CCS semantics via proved transition systems and rewriting logic. In C. Kirchner and H. Kirchner, editors, Proceedings Second International Workshop on Rewriting Logic and its Applications, WRLA'98, Pont-a-Mousson, France, September 1-4, 1998.
....analogous problems involved in the axiomatization of permutation equivalent computations for the calculus given in [20] Acknowledgments. We are grateful to Georgia Carabetta for the many interesting discussions: the present paper is based on a previous work by her and the rst two authors [4], where a weaker correspondence between sequents and proved transitions was established. We are also grateful to one of the referees, whose remarks helped us in improving the overall presentation of our results. ....
G. Carabetta, P. Degano, and F. Gadducci. CCS semantics via proved transition systems and rewriting logic. In C. Kirchner and H. Kirchner, editors, Rewriting Logic and its Applications, volume 15 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences, 1999. Available at http: //www.elsevier.nl/locate/entcs/volume15.html/.
No context found.
G. Carabetta, P. Degano, and F. Gadducci. CCS semantics via proved transition systems and rewriting logic. In Kirchner and Kirchner [47], pages 253--272.
No context found.
G. Carabetta, P. Degano, and F. Gadducci. CCS semantics via proved transition systems and rewriting logic. In Proceedings of WRLA'98, September 1--4, 1998, volume 15 of ENTCS, pages 253--272. Elsevier, 1998. http://www.elsevier.nl/ locate/entcs/volume15.html. 37
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC