pub struct CoverabilityTree {
pub nodes: Vec<CoverabilityNode>,
}Expand description
Coverability tree for a Petri net.
Can determine whether the net is bounded (no OMEGA entries exist).
Fields§
§nodes: Vec<CoverabilityNode>All nodes in the tree.
Implementations§
Source§impl CoverabilityTree
impl CoverabilityTree
Sourcepub fn build(net: &PetriNet) -> Self
pub fn build(net: &PetriNet) -> Self
Build the coverability tree for net starting from its current marking.
Sourcepub fn is_bounded(&self) -> bool
pub fn is_bounded(&self) -> bool
Returns true if the net is bounded (no OMEGA tokens in the tree).
Sourcepub fn node_count(&self) -> usize
pub fn node_count(&self) -> usize
Returns the total number of nodes in the tree.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for CoverabilityTree
impl RefUnwindSafe for CoverabilityTree
impl Send for CoverabilityTree
impl Sync for CoverabilityTree
impl Unpin for CoverabilityTree
impl UnsafeUnpin for CoverabilityTree
impl UnwindSafe for CoverabilityTree
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.