Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. R. Amadio. On the Reduction of CHOCS Bisimulation to π-Calculus Bisimulation. In Concurrency Theory, LNCS 715, pages 112–126. Springer-Verlag, 1993. Proceedings CONCUR conference.
2. R. Amadio and M. Dam. Reasoning about Higher–order Processes. In Theory and Practice of Software Development, LNCS 915, pages 202–216. Springer-Verlag, 1995. Proceedings TAPSOFT '95 conference.
3. E. Astesiano, A. Giovini, and G. Reggio. Generalized Bisimulation on Relational Specifications. In Theoretical Aspects of Computer Science, LNCS 295, pages 207–226. Springer–Verlag, 1988. Proceedings STACS symposium.
4. M. Baldamus. Semantics and Logic of Higher–Order Procsesses: Characterizing Late Context Bisimulation. PhD thesis, computer science department, Berlin University of Technology, 1998.
5. M. Baldamus and J. Dingel. Modal Characterization of Weak Bisimulation for Higher–order Processes (Extended Abstract). In Theory and Practice of Software Development, LNCS 1214, pages 285–296. Springer–Verlag, 1997. Proceedings TAPSOFT '97 conference.