Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 368
Number of items: 368
  • 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.
  • Baeten, J. C. M., Bergstra, J. A., & Reniers, M. A. (2000). Discrete time process algebra with silent step. In G. Plotkin, C. Stirling, & M. Tofte (Eds.), Proof, Language and Interaction: Essays in Honour of Robin Milner (pp. 535-569). MIT Press.
  • Bergstra, J. A., & Bethke, I. (2000). Network algebra in Java. (J.A. Bergstra, Objects, classes, molecules and threads). Informatics Institute.
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2000). Data flow networks in Java. In J. A. Bergstra (Ed.), Objects, classes, molecules and threads Faculteit der Natuurwetenschappen, Wiskunde en Informatica.
Page 28 of 37