We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object...
Abstract. Viewing discrete-time causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the fin...