Search results
Results: 130
Number of items: 130
-
Middelburg, C. A. (2021). Imperative process algebra with abstraction. (v3 ed.) ArXiv. https://doi.org/10.48550/arXiv.2103.07863 -
Bergstra, J. A., & Middelburg, C. A. (2020). On the complexity of the correctness problem for non-zeroness test instruction sequences. Theoretical Computer Science, 802, 1-18. https://doi.org/10.1016/j.tcs.2019.03.040
-
Middelburg, C. A. (2020). Program algebra for random access machine programs. (v1 ed.) ArXiv. https://doi.org/https://arxiv.org/abs/2007.09946v1
-
Middelburg, C. A. (2020). Probabilistic process algebra and strategic interleaving. Scientific Annals of Computer Science, 30(2), 205-243. https://doi.org/10.7561/SACS.2020.2.205
-
van Glabbeek, R. J., & Middelburg, C. A. (2020). On infinite guarded recursive specifications in process algebra. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2005.00746
-
Middelburg, C. A. (2020). Process algebra, process scheduling, and mutual exclusion. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2003.00473
-
Middelburg, C. A. (2020). A classical-logic view of a paraconsistent logic. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2008.07292
-
Bergstra, J. A., & Middelburg, C. A. (2019). Using Hoare logic in a process algebra setting. (v2 ed.) ArXiv. https://arxiv.org/abs/1906.04491v2
-
Middelburg, C. A. (2019). Probabilistic process algebra and strategic interleaving. (1 ed.) Informatics Institute, University of Amsterdam. https://arxiv.org/abs/1912.10041v1
-
Bergstra, J. A., & Middelburg, C. A. (2019). Process Algebra with Strategic Interleaving. Theory of Computing Systems, 63(3), 488–505 . https://doi.org/10.1007/s00224-018-9873-2
Page 2 of 13