Embedded threads in par for you?

Started 25Oct2023, updated 30Oct2023. This is in group Technology if I think it might be worth it. At first I will try to list up relevant other blog notes or lectures I have done or presented over the years, those may have filled in the same points that I initially thought I should do in this note: […]

The «knock-come» deadlock free pattern

New 15Mar2009. Here 22May2026. Updated 04Oct2026 (Moved the AI chapter down and added two paragraphs at the bottom).  macOS apps). This is in groups Technology and My XMOS pages. Search for pages with «knock-come» here. The shortlink to this note is https://wp.me/P75eUQ-9QP. Problem description If relying on synchronous, unbuffered, blocking channels between tasks, like in native CSP […]

My Rust programming language notes

New 29Apr2024. Updated 03Oct2026 ([16]. [15] was missing). This page is in group Technology I guess it’s a post where I try to understand its process model (or task model), and end up being somewhat sceptical of any potential usage on my behalf. Three rusts «Rust has been said to be named after a particularly […]

XCHANs: Notes on a New Channel Type

New 05Oct2023 – updated 18Sep2025 (Overflow buffer). This paper is in group Publications. This note is a restoration and update of XCHANs: Notes on a New Channel Type. See the still existing CPA 2012 page. XCHANs: Notes on a New Channel Type Øyvind Teig. Autronica Fire and Security (AFS) (A UTC Fire and Security company) […]

Publications

New (here) 01Oct2020. Updated 06Sep2025 This page is a mirror of the https://www.teigfam.net/oyvind/pub/pub.html. However, I update more detail here. The references here would add  to my blog posts, which are less formal I guess. Both publications and blog notes are all © Øyvind Teig In English Updated 07Jul2025. Newest on top of the lists: Publications […]

Determined about buffers and bit arrays?

Published 22Dec2016. More like a scratchpad, updated 15July2019 This page is in group Technology. If you want to follow me to try to find out why queueing of entry calls in Ada causes nondeterminstic (scheduling? timing? deadline?) and try to understand why the scheduling of processes on the defunct transputer is the opposite(?), then jump […]

Towards a taxonomy(?) of CSP-based systems

New: 03Nov2016. Last updated 19Ju2026 aPyCSP This page is in group Technology. This note started with an attempt to look at how channels are modelled (in code, really) but then ended up with trying to systemise what I found. The note was even called Channel structures at the start. Towards a classification of CSP-based systems? This might be […]

Timing out design by contract with a stopwatch

Excerpt: Can time be part of a contract? Is it a contract when time is included? «Shall we meet at half past eight at the Pub for a beer?» Let’s steer past that one. Timing requirements are important, they are extensively used in hard real-time systems. In some protocols a client does not need to send any «end of request» signal as the server times out after a period of inactivity to close the connection (like HTTP persistent connections). This blog note tries to discuss when timeouts are fine to use, and when they do turn the components’ interactions into a quiz.