UvA DARE | Search results

UvA-DARE

Digital Academic Repository

UvA-DARE

Results: 371

Number of items: 371

Bergstra, J. A., & Middelburg, C. A. (2005). A thread algebra with multi-level strategic interleaving. Lecture Notes in Computer Science, 3526, 25-48.
Bergstra, J. A., & Bethke, I. (2005). Network algebra in Java. The Journal of Logic and Algebraic Programming, 62(2), 247-271. https://doi.org/10.1016/j.jlap.2004.03.011
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., & Ponse, A. (2005). A Bypass of Cohen's Impossibility Result. (PRG; No. 0501). Informatics Institute.
Bergstra, J. A., & Tucker, J. V. (2005). The rational numbers as an abstract data type. (CSR-12-2005). University of Wales at Swansea (Dept. of Computer Science).
Bergstra, J. A., & Middelburg, C. A. (2005). Strong splitting bisimulation equivalence. In J. L. Fiadeiro, N. Harman, M. Roggenbach, & J. Rutten (Eds.), Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005. Proceedings (pp. 85-99). (Lecture Notes in Computer Science; Vol. 3629). Springer. https://doi.org/10.1007/11548133_6
Delen, G. P. A. J. (2005). Decision- en controlfactoren voor IT-sourcing. [Thesis, fully internal, Universiteit van Amsterdam]. Van Haren.
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.

Page 26 of 38