Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 371
Number of items: 371
  • Bergstra, J. A., & Ponse, A. (1998). Grid protocol specifications. In Propects for hardware foundations (pp. 278-309). (LNCS; No. 1546). Springer Verlag GmbH.
  • Bergstra, J. A., & Ponse, A. (1998). Two recursive generalisations of iteration in process algebra. WINS (oud WINS).
  • Bergstra, J. A., & Loots, M. E. (1998). Program algebra for component code. WINS (oud WINS).
  • Bergstra, J. A., & van Vlijmen, S. F. M. (1998). Theoretische software-engineering: kenmerken, faseringen en classificaties. (Quaestiones Infinitae; Vol. 28). Zeno, the Leiden - Utrecht research institute of philosophy.
  • Bergstra, J. A., Hillebrand, J. A., & Ponse, A. (1997). Grid protocols based on synchronous communication. Science of Computer Programming, 29, 199-233. https://doi.org/10.1016/S0167-6423(96)00035-4
  • Bergstra, J. A., Middelburg, C. A., & Stefanescu, G. (1997). Network algebra for asynchronous dataflow. International Journal of Computer Mathematics, 65, 57-88. https://doi.org/10.1080/00207169708804599
  • Baeten, J. C. M., & Bergstra, J. A. (1997). Bounded bags, stacks and queues. In A. Mazurkiewicz, & J. Winkowski (Eds.), Proceedings CONCUR 1997 (pp. 104-118). (LNCS; No. 1243). Springer-Verlag.
  • Baeten, J. C. M., & Bergstra, J. A. (1997). Discrete time process algebra, absolute time, relative time and parametric time. Fundamenta Informaticae, 29, 51-76.
  • Baeten, J. C. M., & Bergstra, J. A. (1997). Process algebra with propositional signals. Theoretical Computer Science, 177(2), 381-405. https://doi.org/10.1016/S0304-3975(96)00253-8
  • Bergstra, J. A., Fokkink, W. J., Mennen, W. M. T., & van Vlijmen, S. F. M. (1997). Spoorweglogica via EURIS. (Quaestiones Infinitae; No. volume XII). Zeno-insitute for Philosophy.
Page 31 of 38