Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 368
Number of items: 368
  • Bergstra, J. A., & Middelburg, C. A. (2004). Located Actions in Process Algebra with Timing. Fundamenta Informaticae, 64, 183-211.
  • Bergstra, J. A., & Bethke, I. (2003). Polarized Process Algebra and Program Equivalence. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, & G. J. Woeginger (Eds.), Automata, Languages and Programming, 30th International Colloquium, ICALP 2003 (Vol. 2719, pp. 1-21). Springer.
  • 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
  • Bergstra, J. A. (2002). Molecule-oriented programming in Java. Information and Software Technology, 44, 617-638. https://doi.org/10.1016/S0950-5849(02)00065-4
  • Bergstra, J. A., & Bethke, I. (2002). Molecular dynamics. The Journal of Logic and Algebraic Programming, 51(2), 193-214. https://doi.org/10.1016/S1567-8326(02)00021-8
  • Bergstra, J. A., & Loots, M. E. (2002). Program algebra for sequential code. The Journal of Logic and Algebraic Programming, 51(2), 125-156. https://doi.org/10.1016/S1567-8326(02)00018-8
  • Open Access
    van der Zwaag, M. B. (2002). Models and logics for process algebra. [Thesis, externally prepared, Informatics Institute]. Institute for Programming Research and Algorithmics.
  • Open Access
    Luttik, S. P. (2002). Choice quantification in process algebra. [Thesis, externally prepared, Informatics Institute].
  • 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
Page 27 of 37