mirror of
https://github.com/OPCFoundation/UA-.NETStandard.git
synced 2026-10-17 05:11:13 +08:00
ca89ac85a7
# Description Adds a **Generators companion-specification sample** alongside the existing pump sample, and a **`SiteCompositionServer`** that composes several device servers into one OpenUSD scene at a supervisory level — demonstrating that servers can be aggregated without mirroring their address spaces. Three things, in dependency order: ### 1. `GeneratorServer` A self-contained server realising the draft Generators spec (`http://opcfoundation.org/UA/Generators/`) end to end: N simulated generating sets, DI + Machinery integration, a twelve-state operating state machine, four protection alarms per set, six control methods, and a per-set OpenUSD twin. The organising idea is that **load fraction is the only independent variable**. Everything else is a function of it: ``` V̇_f(x) = 3.67 + 100·x fuel rate [L/h] η(x) = P(x) / (V̇_f(x) · ρ · LHV) efficiency S = P / PF I = S / (√3·V_LL) f = N·p / 120 ``` This is not stylistic. When each measurement is an independent oscillator — as the pump sample's simulation once was — a server happily publishes a duty point no real machine could occupy, and no test can catch it because there is nothing for the values to be inconsistent *with*. Deriving them from one variable means `P = √3·V·I·PF` and `η = P/(V̇·ρ·LHV)` hold at every tick by construction. The published `DATASHEET.md`, the engineering ranges, the trip points and the simulation all read the same constants in `GeneratorDatasheet.cs`, so the document and the server cannot describe different machines. The machine is a fictitious **SimGen Systems GenX-500** (400 kW prime / 440 kW standby, 400/230 V, 50 Hz, four-pole). Figures are representative of a real industrial genset class; no vendor is named anywhere in the code or docs. ### 2. Cross-server composition in the connector `RemoteSessionFactory` already existed in the client library but the connector CLI never set it, so cross-server composition was unreachable. `--federate` wires it up: the connector opens a session to each server named by a component binding, discovers its representations and drives its bindings into the same stage. It is **opt-in** because the endpoint the connector dials comes from the server being rendered rather than from the operator, which makes honouring it a trust decision. Federation is best-effort per component — a subordinate that is down is logged and skipped, and the rest of the scene still renders — which is the only `src/` change in this PR. ### 3. `SiteCompositionServer` Owns no devices. It publishes a site stage plus one cross-server component binding per subordinate, carrying that server's `ComponentServerUri` and `ComponentEndpointUrl`. Nothing is mirrored, so there is no cache to invalidate and no second copy of the truth. ## Notes for reviewers **Everything interesting in this PR was found by running the servers, not by reading the code.** Six defects, none of which looked wrong in review: - `IsShutdown` and `SubsystemName` are *optional* on `GeneratorProtectionAlarmType`, so the generated factory does not materialise them. `CreateOrReplace` alone produces a child that exists, appears in `GetChildren` and holds the right value — but carries **no `ReferenceTypeId`**, so no browse can reach it. Every alarm was publishing its trip without saying whether the trip stops the machine or which subsystem to go to. `AddXxx(context)` first is what gives the child its `HasProperty` reference. - **The protections could never fire.** Every trip point sits outside the band the datasheet curves produce — that is what a datasheet *means* — so all four alarms, the shutdown class, `ResetFaults` and the whole `Fault` branch of the state machine were unreachable while the README documented them as observable. Overload was worse: the load clamp ceiling was set to exactly the trip point, making a strictly-greater-than comparison unsatisfiable. Faults are now injectable, and the first set — the one the hero camera frames — develops one on a slow rotation. - **A shutdown trip removes the condition that caused it**, because oil pressure and coolant temperature are only supervised while the engine turns. Each alarm went active for one tick and cleared, leaving an operator with a stopped machine and no indication of why. Shutdown-class alarms now latch until the set leaves the shutdown state. Every unit test that checked the *condition* passed throughout — the defect only appears when the trip and the supervision interact over time. - **`Synchronizing` and `Paralleled` were declared, drawn in the README and never entered.** The first set now energises a dead bus and closes onto it while every other set synchronises to a live one — both how a real plant parallels, and what makes the two states observable. - **The tick raced client method calls.** The simulation tick runs on a thread-pool thread while method calls arrive on request threads, and both transition sets and write the same nodes. A tick moving a set to `Cooldown` and a concurrent `EmergencyStop` could interleave the paired `CurrentState` / `CurrentState.Id` writes and leave a client with a state *name* from one transition and a state *node* from the other — the exact failure the paired write exists to prevent, reintroduced by the threading model. Both paths now take one gate. - Low oil pressure supervised from raw speed **tripped every set during cranking**, because pressure has not built yet. Now gated on `IsSpinning`, which is what a real start-up bypass does. Smaller fixes: shutdown trips are applied after the whole evaluation pass (stopping mid-loop made the remaining conditions read healthy, collapsing simultaneous trips to whichever came first in the table); `ResetFaults` reports its clears as events (a client learns of condition state changes only through events, so a silent clear leaves an alarm-list client showing it forever); the start counter moved into the transition so commanded starts are counted; the federated connector closes the remote session if the connector constructor throws between taking ownership and registering it; and `prepare_machinery_nodeset.py` now *asserts* the IA namespace is last before removing it rather than only claiming so in its docstring — removing any earlier entry would silently renumber every namespace after it and rebind their NodeIds. **A model limitation is left visible rather than papered over.** `GeneratorStateMachineType` declares an emergency stop only out of `Running`, `Loaded` and `Paralleled`, so the sample refuses `EmergencyStop` from `Starting` and `Warmup`. A real panel stops from anywhere. That is the specification's shape, not this sample's choice, so it is pinned by a test and named in the docs. **`Model/` vendors a reduced Machinery nodeset**, derived mechanically by whitelist. The full official nodeset does not survive the model source generator (`MODELGEN003`) and drags in IA through a single optional `Stacklight` member a generating set does not have. Deriving it by script keeps the provenance checkable; the whitelist is the only thing to edit when more types are needed. **Never hand-edit the generated output.** **The federated scene renders end to end.** Getting there surfaced three more defects, all of which produced a plausible-looking scene with nothing in it: the generator sample's plant aggregation was created under an already-registered `DeviceSet` and so was invisible to every client (it had *never* rendered geometry, standalone or federated); the connector's asset fetch ran on the primary session only, so composition referenced layers that were never downloaded; and both generator colour bindings wrote `primvars:displayColor` to prims that did not declare it, so the renderer rejected every update while the file still looked correct. Cross-server components compose under the subordinate's own root, so the site layer now *places* `/Plant` and `/Powerhouse` rather than leaving them stacked on the origin. **`OpenUsdRepresentation` is now mounted with `HasAddIn`, not `HasComponent`** (review feedback). The nodeset says so explicitly — *"Mounted with HasAddIn"* — but every server in the tree used plain `HasComponent`. It survived because `HasAddIn` is a *subtype* of `HasComponent`: the representation still browses, still aggregates and still drives a twin, so every functional test passed before the fix and after it, and only a conformance checker could tell. Seven mount sites corrected. `PumpDeviceIntegrationServer` and `MinimalRobotServer` had hand-rolled the mount instead of calling the shared `CreateRepresentation` helper, which is exactly how they drifted from it. Both sample E2E suites now assert the reference type across **every** discovered representation — a narrower check would have missed the plant-level representation that arrived later from master still carrying `HasComponent`. **Live colour is not achievable in the current OpenUSD viewer, and that is now documented rather than worked around.** Proven with a standalone probe: `primvars:displayColor` resolves as `color3f[]` from the `UsdGeomGprim` schema whatever the layer declares, and the `OpenUsd 0.4.0-alpha` managed API has no writer for that type. Bound `UsdPreviewSurface` materials are not shaded either, so geometry renders grey unless it also carries an explicit `displayColor` primvar. The **visibility** bindings carry no such caveat and are what the samples rely on to show state. Filed upstream as [openusd-dotnet#2](https://github.com/marcschier/openusd-dotnet/issues/2), [#3](https://github.com/marcschier/openusd-dotnet/issues/3) and [#4](https://github.com/marcschier/openusd-dotnet/issues/4), and linked from `docs/OpenUsd.md` so a reader can check whether they have since been fixed. ## Related Issues No tracking issue — this is additive sample and documentation work with a single small, self-contained change to `src/` (per-component error isolation and session-ownership hardening in `OpenUsdConnector.Composition.cs`). Happy to open one if maintainers would prefer it tracked. ## Checklist - [x] I have signed the [CLA](https://opcfoundation.org/license/cla/ContributorLicenseAgreementv1.0.pdf) and read the [CONTRIBUTING](https://github.com/OPCFoundation/UA-.NETStandard/blob/master/CONTRIBUTING.md) doc. - [x] I have added tests that prove my fix is effective or that my feature works and increased code coverage. - [x] I have added all necessary documentation. - [x] I have verified that my changes do not introduce (new) build or analyzer warnings. - [x] I ran **all** tests locally using the **UA.slnx** solution against at least .net **framework** and .net **10**, and all passed. - [ ] I fixed **all** failing and flaky tests in the CI pipelines and **all** CodeQL warnings. - [ ] I have addressed **all** PR feedback received. ### Testing The generator fixtures live in `tests/Opc.Ua.OpenUsd.Tests/Generator` — **82 tests**, no new project. `Opc.Ua.Di.Tests` would have been the natural home next to the pump fixtures, but both device samples source-generate their own reduced `Opc.Ua.Machinery` model and expose it via `InternalsVisibleTo`, so referencing both from one assembly makes every Machinery type ambiguous (CS0433); `Opc.Ua.OpenUsd.Tests` references no other sample and already hosts `RobotAssetContractTests`. The suite runs **870** on net10.0 and net48 (784 existing + 86) and **788** on net472, where the sample does not exist and only the framework-independent asset-contract tests run — forgetting exactly that exclusion broke CI on the sibling pump PR. The tests target the things in this sample that fail *quietly*: - **Datasheet conformance** holds the model to its own claim — rated speed is `120·f/p`, rated current follows from the rating, the fuel curve reproduces the published table, and `η = P/(V̇·ρ·LHV)` reconciles at every load. Efficiency is swept across the whole simulated range to show it stays inside (0,100) and rises monotonically; a fit that goes negative somewhere in its range is a coincidence that happens to look right at the duty point, not a model. A further test reads `DATASHEET.md` and checks the document quotes the figures the server actually serves. - **Drift between the two descriptions of the state machine** — the physics' `IsLegalTransition` and the model's `GeneratorStateMap` — is checked in *both* directions. A transition the physics permits but the map lacks moves a machine without telling a client; one the map holds but the physics refuses is dead weight that looks supported. - **Reachability at run time**, not just in the declared table — the test that catches states the model declares and nothing ever enters. - **That every protection can actually fire**, which is the half of the alarm contract that "a healthy set annunciates nothing" does not cover. A **hosted end-to-end fixture** connects a real client and asserts what the address space actually exposes — the aggregation at `/Powerhouse/Generators`, its component binding, and every per-set twin. That is the only kind of test that catches the registration defect above: the node object had the right browse name, binding and asset reference, so every test that inspected objects passed while no client could see it. **Every state-machine and protection fix was checked by mutation.** Restoring the clamp ceiling, the direct `Running → Loaded` path, the old start-counter placement, or removing the alarm opt-in each makes the corresponding test fail, naming the specific defect. A test that has never been seen to fail has not been shown to work. Verified against a running plant: `Synchronizing`, `Paralleled` and `Fault` all observed on a two-set server, with `HighCoolantTemperatureAlarm` seen active on the fault subject. Method behaviour verified separately — per-set distinct `CurrentState` nodes, `EmergencyStop` → `EmergencyStopped` with `Start` then refused as `BadInvalidState`, `ResetFaults` → `Off`, `SetOperatingMode(9999)` refused with the mode unchanged, and the other sets untouched throughout. Also verified as a three-server federated stage. 0 warnings on a clean Release rebuild of both samples, the client library, the connector and the tests, across every TFM. --------- Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com> Copilot-Session: fe608993-f3c9-4779-a6b9-9a9eabfc24ba
437 lines
16 KiB
C#
437 lines
16 KiB
C#
/* ========================================================================
|
|
* Copyright (c) 2005-2025 The OPC Foundation, Inc. All rights reserved.
|
|
*
|
|
* OPC Foundation MIT License 1.00
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person
|
|
* obtaining a copy of this software and associated documentation
|
|
* files (the "Software"), to deal in the Software without
|
|
* restriction, including without limitation the rights to use,
|
|
* copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the
|
|
* Software is furnished to do so, subject to the following
|
|
* conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be
|
|
* included in all copies or substantial portions of the Software.
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
|
|
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
|
|
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
* OTHER DEALINGS IN THE SOFTWARE.
|
|
*
|
|
* The complete license agreement can be found here:
|
|
* http://opcfoundation.org/License/MIT/1.00/
|
|
* ======================================================================*/
|
|
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
using Generators;
|
|
using GeneratorModel = Opc.Ua.Generators;
|
|
using NUnit.Framework;
|
|
|
|
namespace Opc.Ua.OpenUsd.Tests.Generator
|
|
{
|
|
/// <summary>
|
|
/// Holds the simulated operating state machine to what the model declares.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// The sample keeps two descriptions of the same state machine: a C# enum plus
|
|
/// <see cref="GeneratorSimulation.IsLegalTransition"/>, which the physics uses,
|
|
/// and <see cref="GeneratorStateMap"/>, which translates it onto the numbers
|
|
/// <c>GeneratorStateMachineType</c> declares. Two descriptions of one thing
|
|
/// drift, and when they do, a server reports a machine as running while its
|
|
/// physics say it is stopped and nothing at run time notices. These tests are
|
|
/// what stops that.
|
|
/// </remarks>
|
|
[TestFixture]
|
|
[Category("Generators")]
|
|
public sealed class GeneratorStateMachineTests
|
|
{
|
|
/// <summary>
|
|
/// Every simulated state has a number in the model.
|
|
/// </summary>
|
|
[Test]
|
|
public void EveryStateHasAModelStateNumber()
|
|
{
|
|
foreach (GeneratorRunState state in Enum.GetValues(typeof(GeneratorRunState))
|
|
.Cast<GeneratorRunState>())
|
|
{
|
|
Assert.That(
|
|
GeneratorStateMap.StateNumbers.ContainsKey(state),
|
|
Is.True,
|
|
$"{state} has no state number.");
|
|
}
|
|
}
|
|
|
|
/// <summary>
|
|
/// No two states share a number, or a client cannot tell them apart.
|
|
/// </summary>
|
|
[Test]
|
|
public void StateNumbersAreDistinct()
|
|
{
|
|
Assert.That(
|
|
GeneratorStateMap.StateNumbers.Values.Distinct().Count(),
|
|
Is.EqualTo(GeneratorStateMap.StateNumbers.Count));
|
|
}
|
|
|
|
/// <summary>
|
|
/// The two descriptions of the state machine agree in both directions.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// A transition the physics permits but the map lacks would move a machine
|
|
/// without telling a client; one the map holds but the physics refuses would
|
|
/// be dead weight that looks supported.
|
|
/// </remarks>
|
|
[Test]
|
|
public void LegalTransitionsAndModelTransitionsAgree()
|
|
{
|
|
var states = Enum.GetValues(typeof(GeneratorRunState))
|
|
.Cast<GeneratorRunState>()
|
|
.ToArray();
|
|
|
|
var missingFromMap = new List<string>();
|
|
var missingFromSimulation = new List<string>();
|
|
|
|
foreach (GeneratorRunState from in states)
|
|
{
|
|
foreach (GeneratorRunState to in states)
|
|
{
|
|
bool legal = GeneratorSimulation.IsLegalTransition(from, to);
|
|
bool mapped = GeneratorStateMap.TransitionNumbers.ContainsKey((from, to));
|
|
|
|
if (legal && !mapped)
|
|
{
|
|
missingFromMap.Add($"{from}->{to}");
|
|
}
|
|
if (mapped && !legal)
|
|
{
|
|
missingFromSimulation.Add($"{from}->{to}");
|
|
}
|
|
}
|
|
}
|
|
|
|
Assert.Multiple(() =>
|
|
{
|
|
Assert.That(
|
|
missingFromMap,
|
|
Is.Empty,
|
|
"Transitions the simulation permits but the model map lacks.");
|
|
Assert.That(
|
|
missingFromSimulation,
|
|
Is.Empty,
|
|
"Transitions the model map holds but the simulation refuses.");
|
|
});
|
|
}
|
|
|
|
/// <summary>
|
|
/// No two transitions share a number.
|
|
/// </summary>
|
|
[Test]
|
|
public void TransitionNumbersAreDistinct()
|
|
{
|
|
Assert.That(
|
|
GeneratorStateMap.TransitionNumbers.Values.Distinct().Count(),
|
|
Is.EqualTo(GeneratorStateMap.TransitionNumbers.Count));
|
|
}
|
|
|
|
/// <summary>
|
|
/// Every state can be reached from Off by legal moves.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// A state no path reaches is a state the model declares and the sample
|
|
/// never shows, which is worse than not declaring it.
|
|
/// </remarks>
|
|
[Test]
|
|
public void EveryStateIsReachableFromOff()
|
|
{
|
|
var reached = new HashSet<GeneratorRunState> { GeneratorRunState.Off };
|
|
var queue = new Queue<GeneratorRunState>();
|
|
queue.Enqueue(GeneratorRunState.Off);
|
|
|
|
GeneratorRunState[] states = Enum.GetValues(typeof(GeneratorRunState))
|
|
.Cast<GeneratorRunState>()
|
|
.ToArray();
|
|
|
|
while (queue.Count > 0)
|
|
{
|
|
GeneratorRunState from = queue.Dequeue();
|
|
foreach (GeneratorRunState to in states)
|
|
{
|
|
if (GeneratorSimulation.IsLegalTransition(from, to) && reached.Add(to))
|
|
{
|
|
queue.Enqueue(to);
|
|
}
|
|
}
|
|
}
|
|
|
|
Assert.That(reached, Is.EquivalentTo(states));
|
|
}
|
|
|
|
/// <summary>
|
|
/// Every state except Off can get back to Off, so no set can be stranded.
|
|
/// </summary>
|
|
[Test]
|
|
public void EveryStateCanReturnToOff()
|
|
{
|
|
GeneratorRunState[] states = Enum.GetValues(typeof(GeneratorRunState))
|
|
.Cast<GeneratorRunState>()
|
|
.ToArray();
|
|
|
|
var canReturn = new HashSet<GeneratorRunState> { GeneratorRunState.Off };
|
|
bool grew;
|
|
do
|
|
{
|
|
grew = false;
|
|
foreach (GeneratorRunState from in states)
|
|
{
|
|
if (canReturn.Contains(from))
|
|
{
|
|
continue;
|
|
}
|
|
foreach (GeneratorRunState to in states)
|
|
{
|
|
if (GeneratorSimulation.IsLegalTransition(from, to) &&
|
|
canReturn.Contains(to))
|
|
{
|
|
canReturn.Add(from);
|
|
grew = true;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
while (grew);
|
|
|
|
Assert.That(canReturn, Is.EquivalentTo(states));
|
|
}
|
|
|
|
/// <summary>
|
|
/// Every state the model declares is reached by the running simulation.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// Distinct from <see cref="EveryStateIsReachableFromOff"/>, which walks the
|
|
/// declared transition table. This one drives the actual simulation, and it
|
|
/// is the test that would have caught Synchronizing and Paralleled being
|
|
/// declared, drawn in the README and never entered: a client browsing the
|
|
/// state machine saw two states it could never observe.
|
|
/// </remarks>
|
|
[Test]
|
|
public void EveryStateIsEnteredByTheRunningSimulation()
|
|
{
|
|
var seen = new HashSet<GeneratorRunState>();
|
|
|
|
// Profile 0 energises a dead bus; a later profile synchronises onto a
|
|
// live one, so both paths have to run to cover the model.
|
|
foreach (int profile in new[] { 0, 1 })
|
|
{
|
|
GeneratorSimulation simulation = SimulationHarness.Create(profile);
|
|
simulation.StateChanged = (from, to) => seen.Add(to);
|
|
seen.Add(simulation.State);
|
|
|
|
for (int tick = 0; tick < 4000; tick++)
|
|
{
|
|
simulation.Advance(tick);
|
|
}
|
|
}
|
|
|
|
// A protection trip and the emergency stop are commanded, not part of
|
|
// the free-running cycle.
|
|
GeneratorSimulation tripped = SimulationHarness.Create();
|
|
SimulationHarness.AdvanceUntil(tripped, GeneratorRunState.Loaded);
|
|
tripped.StateChanged = (from, to) => seen.Add(to);
|
|
tripped.Trip();
|
|
|
|
GeneratorSimulation stopped = SimulationHarness.Create();
|
|
SimulationHarness.AdvanceUntil(stopped, GeneratorRunState.Loaded);
|
|
stopped.StateChanged = (from, to) => seen.Add(to);
|
|
stopped.RequestState(GeneratorRunState.EmergencyStopped);
|
|
|
|
var missing = new List<GeneratorRunState>();
|
|
foreach (GeneratorRunState state in Enum.GetValues(typeof(GeneratorRunState))
|
|
.Cast<GeneratorRunState>())
|
|
{
|
|
if (!seen.Contains(state))
|
|
{
|
|
missing.Add(state);
|
|
}
|
|
}
|
|
|
|
Assert.That(missing, Is.Empty, "States the model declares but nothing enters.");
|
|
}
|
|
|
|
/// <summary>
|
|
/// A start commanded through a method is counted, not just an automatic one.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// The counter used to be incremented only in the automatic cycle, so the
|
|
/// more a client used Start or StartTest the further NumberOfStarts drifted
|
|
/// from the truth - the opposite of what a start counter is for.
|
|
/// </remarks>
|
|
[Test]
|
|
public void ACommandedStartIsCounted()
|
|
{
|
|
GeneratorSimulation simulation = SimulationHarness.Create();
|
|
|
|
Assert.That(GeneratorCommands.Start(simulation), Is.True);
|
|
simulation.Advance(0);
|
|
|
|
Assert.That(
|
|
SimulationHarness.LastStartCount(simulation),
|
|
Is.EqualTo(1u),
|
|
"A commanded start was not counted.");
|
|
}
|
|
|
|
/// <summary>
|
|
/// The automatic cycle counts its starts exactly once each.
|
|
/// </summary>
|
|
[Test]
|
|
public void AnAutomaticStartIsCountedOnce()
|
|
{
|
|
GeneratorSimulation simulation = SimulationHarness.Create();
|
|
Assert.That(
|
|
SimulationHarness.AdvanceUntil(simulation, GeneratorRunState.Loaded),
|
|
Is.True);
|
|
|
|
Assert.That(SimulationHarness.LastStartCount(simulation), Is.EqualTo(1u));
|
|
}
|
|
|
|
/// <summary>
|
|
/// A set starts shut down rather than in whatever the enum's default is.
|
|
/// </summary>
|
|
[Test]
|
|
public void ASimulationStartsOff()
|
|
{
|
|
GeneratorSimulation simulation = SimulationHarness.Create();
|
|
Assert.That(simulation.State, Is.EqualTo(GeneratorRunState.Off));
|
|
}
|
|
|
|
/// <summary>
|
|
/// A legal request is accepted and moves the set.
|
|
/// </summary>
|
|
[Test]
|
|
public void ALegalRequestIsAccepted()
|
|
{
|
|
GeneratorSimulation simulation = SimulationHarness.Create();
|
|
|
|
Assert.Multiple(() =>
|
|
{
|
|
Assert.That(simulation.RequestState(GeneratorRunState.Ready), Is.True);
|
|
Assert.That(simulation.State, Is.EqualTo(GeneratorRunState.Ready));
|
|
});
|
|
}
|
|
|
|
/// <summary>
|
|
/// An illegal request is refused and leaves the set where it was.
|
|
/// </summary>
|
|
[Test]
|
|
public void AnIllegalRequestIsRefusedAndChangesNothing()
|
|
{
|
|
GeneratorRunState[] unreachableFromOff =
|
|
[
|
|
GeneratorRunState.Loaded,
|
|
GeneratorRunState.Running,
|
|
GeneratorRunState.Paralleled,
|
|
GeneratorRunState.EmergencyStopped,
|
|
];
|
|
|
|
Assert.Multiple(() =>
|
|
{
|
|
foreach (GeneratorRunState requested in unreachableFromOff)
|
|
{
|
|
GeneratorSimulation simulation = SimulationHarness.Create();
|
|
Assert.That(
|
|
simulation.RequestState(requested),
|
|
Is.False,
|
|
$"Off->{requested} was accepted.");
|
|
Assert.That(
|
|
simulation.State,
|
|
Is.EqualTo(GeneratorRunState.Off),
|
|
$"Off->{requested} moved the set.");
|
|
}
|
|
});
|
|
}
|
|
|
|
/// <summary>
|
|
/// Every state change is announced exactly once, in order.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// The address-space state machine follows this callback, so a change that
|
|
/// is not announced is a change a client never sees.
|
|
/// </remarks>
|
|
[Test]
|
|
public void EveryStateChangeIsAnnouncedOnce()
|
|
{
|
|
GeneratorSimulation simulation = SimulationHarness.Create();
|
|
List<GeneratorRunState> seen = SimulationHarness.RecordStates(simulation);
|
|
|
|
simulation.RequestState(GeneratorRunState.Ready);
|
|
simulation.RequestState(GeneratorRunState.Starting);
|
|
simulation.RequestState(GeneratorRunState.Warmup);
|
|
simulation.RequestState(GeneratorRunState.Running);
|
|
|
|
Assert.That(seen, Is.EqualTo(new[]
|
|
{
|
|
GeneratorRunState.Ready,
|
|
GeneratorRunState.Starting,
|
|
GeneratorRunState.Warmup,
|
|
GeneratorRunState.Running,
|
|
}));
|
|
}
|
|
|
|
/// <summary>
|
|
/// A refused request announces nothing.
|
|
/// </summary>
|
|
[Test]
|
|
public void ARefusedRequestAnnouncesNothing()
|
|
{
|
|
GeneratorSimulation simulation = SimulationHarness.Create();
|
|
List<GeneratorRunState> seen = SimulationHarness.RecordStates(simulation);
|
|
|
|
simulation.RequestState(GeneratorRunState.Loaded);
|
|
|
|
Assert.That(seen, Is.Empty);
|
|
}
|
|
|
|
/// <summary>
|
|
/// Left alone, a set runs itself up to load rather than sitting at Off.
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// The sample's whole point is a plant that looks alive without a client
|
|
/// driving it, so the automatic cycle is part of the contract.
|
|
/// </remarks>
|
|
[Test]
|
|
public void ASetRunsItselfUpToLoad()
|
|
{
|
|
GeneratorSimulation simulation = SimulationHarness.Create();
|
|
|
|
Assert.That(
|
|
SimulationHarness.AdvanceUntil(simulation, GeneratorRunState.Loaded),
|
|
Is.True,
|
|
$"Stalled in {simulation.State}.");
|
|
}
|
|
|
|
/// <summary>
|
|
/// Two sets advance independently of one another.
|
|
/// </summary>
|
|
[Test]
|
|
public void SetsAdvanceIndependently()
|
|
{
|
|
GeneratorSimulation first = SimulationHarness.Create(0);
|
|
GeneratorSimulation second = SimulationHarness.Create(1);
|
|
|
|
first.RequestState(GeneratorRunState.Ready);
|
|
|
|
Assert.Multiple(() =>
|
|
{
|
|
Assert.That(first.State, Is.EqualTo(GeneratorRunState.Ready));
|
|
Assert.That(second.State, Is.EqualTo(GeneratorRunState.Off));
|
|
});
|
|
}
|
|
}
|
|
}
|