Struct TypestateAutomaton 

pub struct TypestateAutomaton {
    pub num_states: usize,
    pub initial: usize,
    pub accepting: BTreeSet<usize>,
    pub transitions: Vec<BTreeMap<String, usize>>,
    pub error_states: BTreeSet<usize>,
}

Represents a finite-state automaton for resource protocol checking. States are usize indices; transitions are labeled by operation names.

Fields

num_states: usize

Number of states.

initial: usize

Initial state.

accepting: BTreeSet<usize>

Accepting (final) states.

transitions: Vec<BTreeMap<String, usize>>

Transition table: transitions[state][op_name] = next_state.

error_states: BTreeSet<usize>

Error states (invalid transitions recorded here).

Implementations

impl TypestateAutomaton

pub fn new(num_states: usize, initial: usize) -> Self

Construct an automaton with n states.

pub fn add_transition(&mut self, from: usize, op: &str, to: usize)

Add a transition: from from via op to to.

pub fn set_accepting(&mut self, state: usize)

Mark a state as accepting.

pub fn simulate(&self, ops: &[&str]) -> Option<usize>

Simulate an operation sequence; return the final state or None on invalid transition.

pub fn accepts(&self, ops: &[&str]) -> bool

Check whether an operation sequence is accepted (ends in accepting state).

pub fn violates(&self, ops: &[&str]) -> bool

Check whether an operation sequence violates the protocol.

Trait Implementations

impl Clone for TypestateAutomaton

fn clone(&self) -> TypestateAutomaton

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for TypestateAutomaton

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.