Struct StateClassGraph 

pub struct StateClassGraph { /* private fields */ }

State Class Graph implementing the Berthomieu-Diaz (1991) algorithm.

BFS exploration with deduplication by canonical key (marking + firing domain).

Implementations

impl StateClassGraph

pub fn new() -> Self

pub fn build( net: &PetriNet, initial_marking: &MarkingState, max_classes: usize, ) -> Self

Builds the state class graph for a Time Petri Net using BFS exploration.

pub fn build_with_env( net: &PetriNet, initial_marking: &MarkingState, max_classes: usize, env_places: &[&str], env_mode: &EnvironmentAnalysisMode, ) -> Self

Builds with environment place support.

pub fn class_count(&self) -> usize

Returns the number of state classes.

pub fn classes(&self) -> &[StateClass]

Returns the state classes.

pub fn edges(&self) -> &[StateClassEdge]

Returns all edges.

pub fn is_complete(&self) -> bool

Returns whether the graph was fully explored (not truncated).

pub fn successors(&self, class_idx: usize) -> &[usize]

Returns successor class indices for a given class.

pub fn predecessors(&self, class_idx: usize) -> &[usize]

Returns predecessor class indices for a given class.

pub fn is_reachable(&self, marking: &MarkingState) -> bool

Checks if a marking is reachable (exists in any state class).

pub fn reachable_markings(&self) -> Vec<&MarkingState>

Returns all unique reachable markings.

pub fn edge_count(&self) -> usize

Returns the edge count.

pub fn enabled_transitions(&self, class_idx: usize) -> &[String]

Returns the enabled transition names for a state class.

pub fn branch_edges( &self, class_idx: usize, transition_name: &str, ) -> Vec<&StateClassEdge>

Returns edges from a given class that fired a specific transition name.

Trait Implementations

impl Debug for StateClassGraph

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

Formats the value using the given formatter.

impl Default for StateClassGraph

fn default() -> Self

Returns the “default value” for a type.