Knowledge baseExam Center
ENEnglish
Choose language13

CKTIS / C#

finite state machines: practical reference

finite state machines: practical reference: A state machine defines finite states and permitted transitions driven by events.

Version: C# language and .NET 10 reference runtime

Syntax

// finite state machines

A state machine defines finite states and permitted transitions driven by events.

Model state with enum or types and one central transition function.

Scattered field changes allow transition rules to be bypassed.

Unknown events, repetition, and terminal states need explicit behavior.

The complete program actually uses finite state machines; its exact expected stdout is Running.

Examples

using System;
using System.Buffers;
using System.Collections.Concurrent;
using System.Collections.Frozen;
using System.Collections.Generic;
using System.Collections.Immutable;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Linq;
using System.Linq.Expressions;
using System.Reflection;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Text;
using System.Text.Json;
using System.Text.Json.Nodes;
using System.Text.Json.Serialization;
using System.Text.RegularExpressions;
using System.Threading;
using System.Threading.Channels;
using System.Threading.Tasks;
using Number = System.Int32;

var state = State.Ready; state = state switch { State.Ready => State.Running, _ => State.Done }; Console.WriteLine(state); enum State { Ready, Running, Done }

Result

Running

The complete program actually uses `finite state machines`; its exact expected stdout is `Running`.

Sources