Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 371
Number of items: 371
  • Bergstra, J. A., & Tucker, J. V. (2006). Elementary algebraic specifications of the rational complex numbers. In K. Futatsugi, J.-P. Jouannaud, & J. Messeguer (Eds.), Algebra, Meaning, and Computations (Vol. 4060, pp. 459-475). Springer-Verlag.
  • Baeten, J. C. M., & Bergstra, J. A. (2006). Six Themes for Future Concurrency Research. Electronic Notes in Theoretical Computer Science, 162, 61-64.
  • Bergstra, J. A. (2006). On the design rationale of ACP based process algebras. Electronic Notes in Theoretical Computer Science, 162, 79-85.
  • Bergstra, J. A., & Middelburg, C. A. (2006). Thread algebra with multi-level strategies. Fundamenta Informaticae, 71(2/3), 153-182.
  • Bergstra, J. A., & Middelburg, C. A. (2006). Continuity controlled hybrid automata. The Journal of Logic and Algebraic Programming, 68(1-2), 5-53. https://doi.org/10.1016/j.jlap.2005.10.002
  • Bergstra, J. A., & Bethke, I. (2005). Network algebra in Java. The Journal of Logic and Algebraic Programming, 62(2), 247-271. https://doi.org/10.1016/j.jlap.2004.03.011
  • Bergstra, J. A., & Bethke, I. (2005). An upper bound for the equational specification of finite state services. Information Processing Letters, 94(6), 267-269. https://doi.org/10.1016/j.ipl.2005.02.010
  • Bergstra, J. A., & Bethke, I. (2005). Polarized process algebra with reactive composition. Theoretical Computer Science, 343, 285-304. https://doi.org/10.1016/j.tcs.2005.06.014
  • Bergstra, J. A., & Middelburg, C. A. (2005). Process algebra for hybrid systems. Theoretical Computer Science, 335, 215-280. https://doi.org/10.1016/j.tcs.2004.04.019
  • Bergstra, J. A., & Ponse, A. (2005). A Bypass of Cohen's Impossibility Result. (PRG; No. 0501). Informatics Institute.
Page 25 of 38