Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 371
Number of items: 371
  • Bergstra, J. A., & Middelburg, C. A. (1995). Process algebra semantics of $\varphi${SDL}. In C. Verhoef, A. Ponse, & S. F. M. van Vlijmen (Eds.), De proceedings: ACP'95 (pp. 309-346)
  • Bergstra, J. A., & Ponse, A. (1995). Frame algebra with synchronous communication. In R. B. Feenstra, & R. J. Wieringa (Eds.), Information Systems - Correctness and Reusability (Selected papers from the ISCORE Workshop) (pp. 3-15). World Scientific.
  • Bergstra, J. A., & Ponse, A. (1995). Frame-based process logics. In M. de Rijke, A. Ponse, & Y. Venema (Eds.), Modal Logic and Process Algebra (pp. 39-63). (CSLI Lecture Notes; No. 53). CSLI Publications.
  • Baeten, J. C. M., & Bergstra, J. A. (1995). Discrete time process algebra (revised version of P9208b). (Technical Report; No. P9208c). onbekend (FdL).
  • Bergstra, J. A., & Stefanescu, G. (1995). Network algebra with demonic relation operators. (Technical Report; No. P9509). onbekend (FdL).
  • Bergstra, J. A., Middelburg, C. A., & Stefanescu, G. (1995). Network algebra for synchronous and asynchronous dataflow. (Technical Report; No. P9508). onbekend (FdL).
  • Bergstra, J. A., Hillebrand, J. A., & Ponse, A. (1995). Grid protocols based on synchronous communication: specification and correctness. (Technical Report; No. P9511). onbekend (FdL).
  • van Benthem, J. F. A. K., & Bergstra, J. A. (1995). Logic of transition systems. Journal of Logic, Language and Information, 3, 247-283.
  • Open Access
    Bergstra, J. A., & Tucker, J. V. (1995). The data type variety of stack algebras. Annals of Pure and Applied Logic, 73, 11-36. https://doi.org/10.1016/0168-0072(94)00038-5
  • Open Access
    Bergstra, J. A., & Heering, J. (1995). Homomorphism preserving algebraic specifications require hidden sorts. Information and Computation, 119(1), 119-123. https://doi.org/10.1006/inco.1995.1079
Page 35 of 38