pub struct TransitionSystem {
pub n_states: usize,
pub successors: Vec<Vec<usize>>,
}Expand description
A finite transition system: a coalgebra S → 𝒫(S) for the finite-powerset polynomial functor.
successors[s] lists the states reachable from s in one step.
Fields§
§n_states: usize§successors: Vec<Vec<usize>>Implementations§
Source§impl TransitionSystem
impl TransitionSystem
Sourcepub fn path(n: usize) -> TransitionSystem
pub fn path(n: usize) -> TransitionSystem
A linear “path” system 0 → 1 → … → n-1 — the shape of a (deterministic) proof trajectory.
Trait Implementations§
Source§impl Clone for TransitionSystem
impl Clone for TransitionSystem
Source§fn clone(&self) -> TransitionSystem
fn clone(&self) -> TransitionSystem
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for TransitionSystem
impl RefUnwindSafe for TransitionSystem
impl Send for TransitionSystem
impl Sync for TransitionSystem
impl Unpin for TransitionSystem
impl UnsafeUnpin for TransitionSystem
impl UnwindSafe for TransitionSystem
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