lemonergy· battery engineering courses

Lemonergy · Studio block

Invocation feedback kernel

Each call reads the previous held result, runs one child and commits its new result before the next call at the same timestamp.

Implementation ID
native-invocation-feedback
Reviewed
2026-10-27

Behavior

Each call reads the previous held result, runs one child and commits its new result before the next call at the same timestamp. Outputs are held between accepted samples; numerical evaluation does not commit hidden state.

Interface

Invocation feedback kernel interfaceInputs or arguments on the left, observed outputs on the right. Conserving terminals appear below the component. The tables give units and behavior.Invocation feedback kernelStudio blockin0out0out1
Original Lemonergy interface view. Lines identify ports; they are not a completed simulation circuit.
Ports and observed outputs
NameDirectionUnitMeaning
in0input—Calls; u32 scalar.
out0output—Biased value; real scalar.
out1output—Invocations this sample; u32 scalar.

Parameters

Defaults are initial model values. Select values for your own model and operating conditions.

Configuration fields
ParameterUnitDefaultMeaning and limits
Sample period
sampleTimeS		s1Positive interval between accepted control samples. Outputs hold between these instants.
Minimum 0
Maximum calls per sample
params[0]		—161–256; the initial output is the first feedback snapshot.
Child operation
nested		—BiasOne configurable native computation operation. Its declared input/output types must match the wrapper.
Initial held outputs
tables[0]		—[0]Initial values for all child output lanes, in output order. For independent elements, supply one value per element.

Equations and rules

  • For each call: output ← child(state, previous output)
  • The initial held output is the first feedback input

Worked example

Invocation feedback kernel worked example

Default editable example at the first accepted sample (t = 0 s). Child operation: bias. The output checks below are execution oracles for this example.

Open Studio example after release →
Numerical checks for the bundled synthetic example
OutputTime (s)Expected valueUnitAbsolute tolerance
Biased value
out0		03—1e-08
Invocations this sample
out1		03—1e-08

Explore the recorded outputs

Invocation feedback kernel recorded example

Invocation feedback kernel / Biased value
Invocation feedback kernel / Biased value against timeRecorded synthetic simulation values. Time in seconds; output in —.2.5204.260.5617.741.59.482—Time (s)
Invocation feedback kernel / Biased value: 3 — at 0 s

3 actual recorded samples. Lines are visual guides between samples. Synthetic example, not measured cell data.

Download the recorded samples (JSON) · Open this Studio example after release

Use in a workflow

Invocation feedback kernel worked example

Each call reads the previous held result, runs one child and commits its new result before the next call at the same timestamp.

  1. Invocation feedback kernel: Each call reads the previous held result, runs one child and commits its new result before the next call at the same timestamp. Outputs are held between accepted samples; numerical evaluation does not commit hidden state.
    • Use the block reference for settings and connections.
    • Implementation tested locally; public release pending.
Open Studio example after release

Connected concepts

Limits and interpretation

  • Control executes on an explicit sampled clock. Continuous states, history/delay kernels, residual equations, and event-source children are not supported.
  • The wrapper contains one original computation operation; arbitrary multi-block submodels are not supported.
  • A sampled child advances once per invocation using its own declared period. Repeated calls share the same outer timestamp and do not advance physical time.
  • One explicit child and one matching input/output port; no global function namespace or arbitrary feedback subgraph. At most 256 calls per sample.

Scientific and mathematical references

These sources explain the scientific and mathematical background. The behavior, interface and limits above define the Lemonergy implementation; a citation does not imply every model option in the source is implemented.

  1. Synchronous Data Flow

    Edward A. Lee, David G. Messerschmitt · Proceedings of the IEEE, 75(9), 1235–1245 · 1987

    Technical reference · Background on actor firing and explicit dataflow. The sampled conditional semantics documented here are Lemonergy design choices, not a claim of a complete SDF implementation.

Implementation sources

This reference follows the public interface and locally verified numerical checks for an upcoming release.

Contract: Lemonergy Studio public contract · Verification record: verification-2026-10-27

  • docs/glossary/native-block-verification.json

This implementation and its workflow uses (JSON) · Knowledge graph (JSON-LD)