Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 29
Number of items: 29
  • Baeten, J. C. M., & Bergstra, J. A. (1994). Process algebra with partial choice. In J. Parrow, & B. Jonsson (Eds.), Proceedings CONCUR 94, Uppsala, Sweden (pp. 401-416). (Lecture Notes in Computer Science; No. 836). Springer Verlag.
  • Baeten, J. C. M., Bergstra, J. A., & Bol, R. N. (1994). A real time process logic. In H. J. Ohlbach, & D. M. Gabbay (Eds.), Proceedings ICTL 94 (pp. 30-47). (LNAI; No. 827). Springer Verlag.
  • Bergstra, J. A., & Baeten, J. C. M. (1994). Graph isomorphism models for non interleaving process algebra. In C. Verhoef, A. Ponse, & S. F. M. van Vlijmen (Eds.), Algebra of Communicating Processes, Utrecht 1994 (pp. 299-318). (Workshops in Computing). Springer Verlag.
  • Baeten, J. C. M., & Bergstra, J. A. (1994). Real time process algebra with infinitesimals. In C. Verhoef, A. Ponse, & S. F. M. van Vlijmen (Eds.), Algebra of Communicating Processes, Utrecht 1994 (pp. 148-187). (Workshops in Computing). Springer Verlag.
  • Klusener, A. S. (1994). Models and Axioms for a Fragment of Real Time Process Algebra. [Thesis, internally prepared, tue].
  • Korver, H. P. (1994). Protocol Verification in mCRL. [Thesis, internally prepared, Universiteit van Amsterdam].
  • Open Access
    Baeten, J. C. M., & Bergstra, J. A. (1994). On sequential composition, action prefixes and process prefix. Formal Aspects of Computing, 6, 250-268.
  • Open Access
    Fokkink, W. J. (1994). Clocks, Trees and Stars in Process Theory. [Thesis, internally prepared, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Baeten, J. C. M., Bergstra, J. A., & Klop, J. W. (1993). Decidability of bisimulation equivalence for processes generating context free languages. Journal of the Association for Computing Machinery, 40(3), 653-682. https://doi.org/10.1145/174130.174141
Page 3 of 3