Skip to main content

PetriNet

Struct PetriNet 

Source
pub struct PetriNet {
    pub places: Vec<Place>,
    pub transitions: Vec<Transition>,
    pub arcs_in: Vec<(usize, usize, Weight)>,
    pub arcs_out: Vec<(usize, usize, Weight)>,
}
Expand description

A classical (Place/Transition) Petri net.

Arcs are stored as (transition_idx, place_idx, weight) triples.

Fields§

§places: Vec<Place>

All places in this net.

§transitions: Vec<Transition>

All transitions in this net.

§arcs_in: Vec<(usize, usize, Weight)>

Input arcs: (transition, place, weight) – tokens consumed on fire.

§arcs_out: Vec<(usize, usize, Weight)>

Output arcs: (transition, place, weight) – tokens produced on fire.

Implementations§

Source§

impl PetriNet

Source

pub fn new() -> Self

Create an empty Petri net.

Source

pub fn add_place(&mut self, place: Place) -> usize

Add a place and return its index.

Source

pub fn add_transition(&mut self, transition: Transition) -> usize

Add a transition and return its index.

Source

pub fn add_arc_in(&mut self, t: usize, p: usize, weight: Weight)

Add an input arc: transition t consumes weight tokens from place p.

Source

pub fn add_arc_out(&mut self, t: usize, p: usize, weight: Weight)

Add an output arc: transition t produces weight tokens into place p.

Source

pub fn marking(&self) -> Vec<usize>

Return the current marking (token counts for every place).

Source

pub fn set_marking(&mut self, marking: &[usize])

Apply a marking vector to the net (sets token counts).

Source

pub fn enabled_transitions(&self) -> Vec<usize>

Return indices of all currently enabled transitions.

A transition is enabled when every input arc can be satisfied and the guard (if any) returns true.

Source

pub fn fire(&mut self, t_idx: usize) -> Result<(), String>

Fire transition t_idx, updating token counts.

Returns Ok(()) on success or Err(String) if the transition is not enabled.

Source

pub fn is_deadlocked(&self) -> bool

Returns true if no transition is currently enabled (deadlock).

Source

pub fn marking_sum(&self) -> usize

Sum of all tokens in the net (useful for conservation checks).

Source

pub fn reachability_bfs(&self) -> HashSet<Vec<usize>>

BFS over reachable markings from the current marking.

Returns the set of all reachable markings (including the initial one).

Trait Implementations§

Source§

impl Clone for PetriNet

Source§

fn clone(&self) -> PetriNet

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for PetriNet

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for PetriNet

Source§

fn default() -> Self

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.