Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 371
Number of items: 371
  • 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
  • Bergstra, J. A., Ponse, A., & Smolka, S. A. (2001). Handbook of Process Algebra. Elsevier Science.
  • Bergstra, J. A., & Ponse, A. (2001). Process algebra and conditional composition. Information Processing Letters, 80(1), 41-49. https://doi.org/10.1016/S0020-0190(01)00216-2
  • Bergstra, J. A., & Ponse, A. (2001). Non-regular iterators in process algebra. Theoretical Computer Science, 269(1-2), 203-229. https://doi.org/10.1016/S0304-3975(00)00413-8
  • Bergstra, J. A., Fokkink, W. J., & Ponse, A. (2001). Process algebra with recursive operations. In J. A. Bergstra, A. Ponse, & S. A. Smolka (Eds.), Handbook of Process Algebra (pp. 333-389). Elsevier.
  • Bergstra, J. A., Middelburg, C. A., & Usenko, Y. S. (2001). Discrete time process algebra and the semantics of SDL. In J. A. Bergstra, A. Ponse, & S. A. Smolka (Eds.), Handbook of Process Algebra (pp. 1209-1268). Elsevier.
  • Bergstra, J. A., Ponse, A., & van der Zwaag, M. B. (2000). Branching Time and Orthogonal Bisimulation Equivalence. (Report SEN; No. R0035). CWI.
  • Bergstra, J. A., & Loots, M. E. (2000). Program algebra for component code. Formal Aspects of Computing, 12, 1-17.
Page 28 of 38