pub struct PetriNetMassActionAnalysis {
pub place_ob_type: ModalObType,
pub transition_mor_type: ModalMorType,
}Expand description
Mass-action ODE analysis for Petri nets.
This struct implements the object part of the functorial semantics for reaction networks (aka, Petri nets) due to Baez & Pollard.
Fields§
§place_ob_type: ModalObTypeObject type for places.
transition_mor_type: ModalMorTypeMorphism type for transitions.
Implementations§
Source§impl PetriNetMassActionAnalysis
impl PetriNetMassActionAnalysis
Sourcepub fn build_system(
&self,
model: &ModalDblModel,
) -> PolynomialSystem<QualifiedName, Polynomial<QualifiedName, f32, u8>, u8>
pub fn build_system( &self, model: &ModalDblModel, ) -> PolynomialSystem<QualifiedName, Polynomial<QualifiedName, f32, u8>, u8>
Creates a mass-action system with symbolic rate coefficients.
Sourcepub fn build_numerical_system(
&self,
model: &ModalDblModel,
data: MassActionProblemData,
) -> ODEAnalysis<NumericalPolynomialSystem<u8>>
pub fn build_numerical_system( &self, model: &ModalDblModel, data: MassActionProblemData, ) -> ODEAnalysis<NumericalPolynomialSystem<u8>>
Creates a mass-action system with numerical rate coefficients.
Sourcepub fn build_stochastic_system(
&self,
model: &ModalDblModel,
data: MassActionProblemData,
) -> StochasticMassActionAnalysis
pub fn build_stochastic_system( &self, model: &ModalDblModel, data: MassActionProblemData, ) -> StochasticMassActionAnalysis
Creates a stochastic mass-action system.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for PetriNetMassActionAnalysis
impl RefUnwindSafe for PetriNetMassActionAnalysis
impl Send for PetriNetMassActionAnalysis
impl Sync for PetriNetMassActionAnalysis
impl Unpin for PetriNetMassActionAnalysis
impl UnwindSafe for PetriNetMassActionAnalysis
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<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.