Struct biodivine_lib_param_bn::async_graph::AsyncGraph

pub struct AsyncGraph<P: AsyncGraphEdgeParams> {
    edges: P,
}

👎 Deprecated

An asynchronous transition system of a BooleanNetwork. The states of the graph are standard IdStates. The parameter sets are given by the associated AsyncGraphEdgeParams.

Async graph implements the standard “asynchronous update”, i.e. every variable can be non-deterministically updated at any time, but the actual parameters for which this happens are determined by the AsyncGraphEdgeParams.

This actually hides a lot of complexity, because implementing AsyncGraphEdgeParams is typically much easier than re-implementing the whole async graph structure.

AsyncGraph in its current form and the related structures are deprecated in favour of SymbolicAsyncGraph. We may re-implement it later under a new name and a new API, because in some niche use cases it seems to be faster than fully symbolic approach. However, try not to rely on this implementation too much.

Fields

edges: P

👎 Deprecated

Implementations

impl AsyncGraph<DefaultEdgeParams>

pub fn new(
    network: BooleanNetwork
) -> Result<AsyncGraph<DefaultEdgeParams>, String>

Create a new AsyncGraph from the given BooleanNetwork using default edge parameter implementation.

impl<Params: AsyncGraphEdgeParams> AsyncGraph<Params>

pub fn new_with_edges(edge_params: Params) -> Result<AsyncGraph<Params>, String>

Create a new AsyncGraph using given edge parametrisation.

pub fn num_states(&self) -> usize

Return the total number of states in this graph.

pub fn network(&self) -> &BooleanNetwork

Return a reference to the original Boolean network.

pub fn edges(&self) -> &Params

Expose the inner edge implementation.

pub fn make_witness(&self, params: &Params::ParamSet) -> BooleanNetwork

Make a witness network for one parametrisation in the given set.

pub fn empty_params(&self) -> &Params::ParamSet

Return an empty set of parameters.

pub fn unit_params(&self) -> &Params::ParamSet

Return a full set of parameters.

Trait Implementations

impl<'a, Edges: AsyncGraphEdgeParams> Graph for &'a AsyncGraph<Edges>

type State = IdState

type Params = Edges::ParamSet

type States = IdStateRange

type FwdEdges = Fwd<'a, Edges>

type BwdEdges = Bwd<'a, Edges>

fn states(&self) -> Self::States

fn fwd(&self) -> Self::FwdEdges

fn bwd(&self) -> Self::BwdEdges

impl<'a, Edges: AsyncGraphEdgeParams> InvertibleGraph for &'a AsyncGraph<Edges>

type FwdEdges = Fwd<'a, Edges>

type BwdEdges = Bwd<'a, Edges>