← Back
Home › Systems › Biotech and life sciences

lab-automation

Biotech and life sciences | lab-automation — liquid-handler and workcell control: deck layout and labware definitions, liquid classes, pipetting step compiler, workcell scheduler with plate movers, SiLA 2 and instrument drivers, audit trail

Hamilton VENUS, Tecan FluentControl, Biosero Green Button Go, HighRes Cellario, Thermo Momentum, Opentrons, PyLabRobot

SystemTechniques · 27Primitives · 61 lab-automation Human-in-the-loop approvalagentic-ai · medium: Classify each proposed action as auto, ask or deny; park asks as durable pending records a human approves, edits or rejects, executing once, with timeouts that deny.›FFI bindings generationcompilers · medium: Describe a library's C-ABI surface once (header, attributes or IDL) and generate the declarations, converters and wrappers for each caller language.›Instruction schedulingcompilers · medium: List scheduling over dependence DAGs with latency models; software pipelining of loopsDAG workflow executiondistributed · medium: Run a graph of dependent tasks by releasing each one when its inputs are done, longest chain first, and skip any task whose input hashes are unchanged.›Saga patterndistributed · medium: Split a cross-service operation into local transactions, each paired with an undo; on failure run the undos in reverse, or retry forward.›Critical path analysisgraphs · medium: Longest dependency chain in a DAG of timed spans or build actionsJob-shop schedulingoptimization · medium: Model jobs as chains of operations, resource order as a choice of arc directions, and minimise the longest path; build with dispatching rules, improve by swapping critical neighbours or solve with CP.›Trusted timestampingsecurity · low: RFC 3161 time-stamp tokens: a TSA signs a hash with time, proving data existed thenProtobuf wire formatnetworking · low: Protocol Buffers wire format: tags, varints, length-delimited fields and schema evolutionHomogeneous transformsgeometry · low: 4x4 affine and projective matrices, homogeneous coordinates, view and projection, normal matricesGrpc protocolnetworking · low: GRPC framing over HTTP/2: unary and streaming RPCs, deadlines, statusTime-window feasibilityoptimization · low: Keep earliest/latest start and slack per segment so "does this insertion or move keep every window?" costs O(1) instead of a walk down the sequence.›Hierarchical state machinesystems · low: Nest states so a substate inherits its parent's reactions and only overrides what differs, with ordered entry and exit actions along the path.›Statechartsgraphics · low: State machines with nesting, parallel regions, history and entry/exit actions, so UI and animation logic stays linear in size instead of exploding.›Dual control approvalsecurity · low: Four-eyes / maker-checker approval with quorum policies for sensitive operationsHierarchical timing wheelsystems · low: Timers bucketed by expiry into wheels of slots, coarser wheels for far deadlines: O(1) insert and cancel for millions of timeouts.›Calling conventions abicompilers · low: System V, Windows x64 and AAPCS64 ABIs: argument registers, stack frames, struct passing, FFIReference countingcompilers · low: Keep a count of owners in each object, free it when the count hits zero; deterministic and local, but pays on every copy and leaks cycles.›d-ary heapdata-structures · low: Array heap with d children per node (d = 4 typical): half the binary heap's depth, siblings in one cache line, faster priority queues.›Topological sortgraphs · low: Order the vertices of a DAG so every edge points forward; the core of build systems, schedulers and dependency resolution, with cycle detection for free.›Instruction pipelininghardware-os · low: Pipeline stages, hazards, forwarding and stalls in CPU coresContent-addressed storagestorage · low: Store each blob under the hash of its bytes: immutable, deduplicated by construction, self-verifying on every read, and composable into Merkle trees.›Exponential backoff with jittersystems · low: Retry after delays that grow geometrically and are randomized, so failed clients spread out instead of hammering a recovering service in synchronized waves.›+ 20 more techniques+ 45 more primitives

Similar systems

Share the most building blocks with this one.

rail-traffic-management 15 %