Make.Rval pp :
Ppx_deriving_runtime.Format.formatter ->
t ->
Ppx_deriving_runtime.unitval show : t -> Ppx_deriving_runtime.stringval to_yojson : t -> Yojson.Safe.tval of_yojson : Yojson.Safe.t -> t Ppx_deriving_yojson_runtime.error_orval pp_label :
Ppx_deriving_runtime.Format.formatter ->
label ->
Ppx_deriving_runtime.unitval show_label : label -> Ppx_deriving_runtime.stringval label_to_yojson : label -> Yojson.Safe.tval label_of_yojson :
Yojson.Safe.t ->
label Ppx_deriving_yojson_runtime.error_orexception NOT_VALID of react_errorval name : t -> stringReturns the name of a rewrite rule.
val make :
name:string ->
lhs:Big.t ->
rhs:Big.t ->
?conds:AppCond.t list ->
?cond_captures:string list ->
label ->
Fun.t option ->
tCreate a new reaction rule. cond_captures names the LHS captures a factored rule's condition patterns reference (empty for every hand-written rule); at match time those captures are grounded into the condition patterns before the containment check.
val is_valid : t -> boolValidity check.
val is_valid_err : t -> (bool, react_error) Stdlib.resultSame as is_valid_exn but returns the exception as Error e or Ok true.
val string_of_react_err : react_error -> stringConvert to string the output of the validity check.
is_enabled b r checks if rewrite rule r can be applied to bigraph b.
Merge isomorphic occurrences into a single representative, combining labels where appropriate.
Apply a list of reaction rules in sequence. Non-enabled rules are ignored.
fix b r_list applies the rewrite rules in list r_list to bigraph b until a fixed point b' is reached. The result is fixed point b' and the number of rewriting steps performed. Note, b is returned when no rewriting is performed.
All the possible evolutions in one step. Total number of occurrences also returned.
Random step.
val random_step_forced :
Stdlib.Random.State.t ->
Big.t ->
t list ->
t ->
(Big.t * label * t list) option * intRandom step conditioned on rule firing: the successor is drawn from the rule's occurrences and the SBRS sojourn at the exit rate of the full class rules. The rule's occurrence count is returned.
Resolve all internal function refs to the chosen implementation based on solver type. Call once after rule compilation, before any matching operations. Eliminates per-step conditional branches.
Set the group-size threshold for wildcard structural matching. Groups with fewer than n rules use direct per-rule matching; larger groups use wildcard structural matching (one solve + partition). Default is 3. Set to 1 to force wildcard for all groups; set very high to disable wildcard entirely. Call before select_path.