Expand description

Legacy semi-symbolic representation of the coloured asynchronous state-transition graph.

It represents states explicitly (see IdState), but uses symbolic representation (BddParams) for sets of parameters.

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 and/or easier to use than a fully symbolic approach. However, try not to rely on this implementation too much.

Modules

Structs

AsyncGraphDeprecated

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

A backward EvolutionOperator of the AsyncGraph.

An iterator over predecessors of a state in the AsyncGraph.

Default implementation for edge parameters which adheres to the monotonicity and observability constraints of the network, but poses no other restrictions.

A forward EvolutionOperator of the AsyncGraph.

An iterator over successors of a state in the AsyncGraph.

Traits

Async graph edges implement the edge colouring (parametrisation) of a graph. Instances of this trait are used together with the AsyncGraph to produce a semantic coloured graph of a parametrised Boolean network.