Author:
Grosu Radu,Broy Manfred,Selic Bran,Stefănescu Gheorghe
Reference12 articles.
1. [A96]S. Abramsky. Retracing some paths in process algebra. In Seventh International Conference on Concurrency Theory (Concur’96), Lecture Notes Computer Science 1055, pages 21–33, 1996.
2. S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and the foundations of typed concurrent programming. To appear in Proc. Marktoberdorf Summer School, 1994.
3. R. Alur, T. A. Henzinger, F.Y.C. Mang, S. Qadeer, S. K. Rajamani, and S. Tasiran. Mocha: Modularity in model checking. To appear in the Proceedings of the Tenth International Conference on Computer-aided Verification (CAV 1998), Lecture Notes in Computer Science, Springer-Verlag, 1998.
4. M. Broy. Semantics of finite and infinite networks of concurrent communicating agents. Distributed Computing, 2: 13–31, 1987.
5. V.E. Căzănescu and Gh. Stefănescu. Towards a new algebraic foundation of flowchart scheme theory. Fundamenta lnformaticae, 13: 171–210, 1990.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献