Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 368
Number of items: 368
  • Bergstra, J. A., & Bethke, I. (2005). An upper bound for the equational specification of finite state services. Information Processing Letters, 94(6), 267-269. https://doi.org/10.1016/j.ipl.2005.02.010
  • Bergstra, J. A., & Bethke, I. (2005). Polarized process algebra with reactive composition. Theoretical Computer Science, 343, 285-304. https://doi.org/10.1016/j.tcs.2005.06.014
  • Bergstra, J. A., & Middelburg, C. A. (2005). Process algebra for hybrid systems. Theoretical Computer Science, 335, 215-280. https://doi.org/10.1016/j.tcs.2004.04.019
  • Bergstra, J. A., Bethke, I., & Ponse, A. (2005). Decision Problems for Pushdown Threads. (PRG0502). Informatics Institute.
  • Bergstra, J. A., & Klint, P. (2005). About 'trivial' software patents: the IsNot case. (SEN-R0517). CWI.
  • Open Access
    Delen, G. P. A. J. (2005). Decision- en controlfactoren voor IT-sourcing. [Thesis, fully internal, Universiteit van Amsterdam]. Van Haren.
  • Bergstra, J. A. (2004). Machine Function Based Control Code Algebras. Lecture Notes in Computer Science, 3188, 17-41.
  • Bergstra, J. A. (2004). Axioms for SNABOK, a System and Network Administration Body of Knowledge: Missing Link Stage of Ontology Process. (Logic Group Preprint Series; No. 227). Universiteit van Utrecht.
  • Bergstra, J. A., & Middelburg, C. A. (2004). Process Algebra for Hybrid Systems. (Logic Group Preprint Series; No. 225). Universiteit van Utrecht.
  • Bergstra, J. A., & Bethke, I. (2004). Linear Projective Program Syntax. (Logic Group Preprint Series; No. 233). Universiteit van Utrecht.
Page 26 of 37