Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 107
Number of items: 107
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2005). Decision Problems for Pushdown Threads. (PRG0502). Informatics Institute.
  • Bethke, I., & Ponse, A. (2003). Programma-Algebra, een inleiding tot de Programmatuur. Vossiuspers UvA.
  • Bergstra, J. A., Ponse, A., & van der Zwaag, M. B. (2003). Branching Time and Orthogonal Bisimulation Equivalence. Theoretical Computer Science, 309(1-3), 313-355. https://doi.org/10.1016/S0304-3975(03)00277-9
  • Bergstra, J. A., & Ponse, A. (2002). Combining programs and state machines. The Journal of Logic and Algebraic Programming, 51(2), 175-192. https://doi.org/10.1016/S1567-8326(02)00020-6
  • Ponse, A. (2002). Program algebra with unit instruction operators. The Journal of Logic and Algebraic Programming, 51(2), 157-174. https://doi.org/10.1016/S1567-8326(02)00019-X
  • Bergstra, J. A., & Ponse, A. (2001). Register-machine based processes. Journal of the Association for Computing Machinery, 48(6), 1207-1241. https://doi.org/10.1145/504794.504799
  • Ponse, A. (2001). Iteration in process algebra. In R. Backhouse, D. Kozen, & B. Moeller (Eds.), Applications of Kleene Algebra, Report 298 (Report; No. 298). Dagstuhl Seminar no. 01081.
  • Bergstra, J. A., Ponse, A., & Smolka, S. A. (2001). Handbook of Process Algebra. Elsevier Science.
  • Ponse, A., & Usenko, Y. S. (2001). Equivalence of recursive specifications in process algebra. (Report; No. SEN-R0107). CWI.
  • Ponse, A., & Usenko, Y. S. (2001). Equivalence of recursive specifications in process algebra. Information Processing Letters, 80(1), 59-65. https://doi.org/10.1016/S0020-0190(01)00218-6
Page 7 of 11