Index of values

cons_option

One event loop

add_agent ?id sigs agent_type graph

depend in time, depend in event number, depend in given var

add_free agent_id site graph

add_internal agent_id site internal_state graph

add_link ag1 s1 ag2 s2 t Some (i,j) as second returned element means cc j is now merged into cc i

allowed_link ag1 s1 ag2 s2 sigs

are_connected ?max_distance graph nodes_x nodes_y

arity sigs agent_id

Starts creation

Retuns the extension of the given injections so that the second edge is the image of the first

compress a trace with the level of abstraction defined in the argument parameter.

Deserialize JSON data of type User_graph.connected_component.

Smart constructor

You'd better NOT use that on the state of a simulation

Give the number of stories (up to isomorphism classes) stored in a table

create initial_guess_size

Initialization

cut performs partial order reduction and remove orthogonal events

diff a b = minus (union a b) (inter a b)

Deserialize JSON data of type Primitives.din_kind.

Deserialize JSON data of type Data.din.

empty ~with_delta_activities env stopping_times

What to do after stopping simulation.

compute transitive closure with different parameters (progress_bar, gc)

error_init is an empty log of errors

exists_fresh ag1 site1 type_of_ag2 site2 graph

Show the current status of the branch and cut assumptions in a libreoffice macro file

convert a table into a list of grid (with runtime information)

fill_siphon adds spurious init event, to break causal dependences; Currently, it inserts an init event when an agent return to its initial state; other heuristics may be considered; The output has to be disanbiguated, otherwise it is useless (compression will remove the ficitious init events) It should work in quasi linear time (I think)

Abstraction leak, please do not use

put together the stories having the same canonic form, this has do be done explicitely on the moment, I will improve this soon

USE WITH CARE: Break some abstraction.

fold over the causal past of each observable in a given trace, the first argument indicates whether we display the current steps on the err output; the second arfument indicated whether the function is launched in debug mode or not

Apply a function on each trace (and each list of runtime information associated to this trace), the string contains the message to display in case of faillure of one call of the ternary function

get sigs agent_id

get the id of an event in the simulation (only proper events have an id)

get_internal ag site graph

Use

conversely, convert a trace in a list of refined steps

Musical processing

get the date of an event in the simulation (only proper events have a time)

graph_page title deps header core f

check wether there is an observable in a trace

id_of_internal_state agent_type site_name state_name sigs

id_of_site agent_type site_name sigs

Infer agent signatures and tokens from init, rules and perturbations

id, arity, before, after

init sigs tokens algs dependencies (ast_rules,rules) obs perts

initial env counter graph state builds up the initial state

euler division when only int are involved, float div else

internal_state_number agent_id site_id sigs

is_agent agent graph

is_free agent_id site graph

is_internal internal_state agent_id site graph

determines whether or not a step can be applied from a given state.

same function but takes a graph of type Edges.t directly.

is_subnavigation inj_nav2sub nav subpart

iteri f x n

link_destination ag site graph

link_exists ag1_id site1 ag2_id site2 graph

Fragile: the list MUST NOT be a singleton

@Return: (r_mix,r_create)

reallocate agent id to avoid conflict (implicitly called by cut and fill_siphon)

max_arity sigs returns max

maybe_iteri f x n

Set union of 2 sorted list When l1 is included in l2: merge_uniq l1 l2 == merge_uniq l2 l1 == l2

minus a b contains elements of a that are not in b

new_link_type work (node,site) type

new_link wk (node, site_id) (node', site_id')

new_node wk node_type

num_of_internal_state site_id state_name sign

observables_from_free domain graph sort agent the int * int in the return list and the following ones is a Instantiation.concrete

observables_from_free domain graph sort agent site

observables_from_internal domain graph sort agent site internal_state

observables_from_link domain graph sort ag site sort' ag' site'

Returns (the current biological time, an array of the current values of observables)

open_out_fresh base facultative ext

partition_set f set is the map mapping any element b with an antecedent for f in the set set, into the set of its antecedents, ie to the set {a\in set | f(a)=b}.

Deserialize JSON data of type Data.plot.

positive_transformations_of_actions signature side_effect_dsts actions

Floats are compactly printed

print signatures find_existing_type nav

print ~domain ?with_id:None form cc

The int is the ast_rule_id

Prints nothing in case of infinity or Not a Number

Same as above but the int is this time the rule_id

print_site_internal_state sigs agent_type site_id f state_id prints both the site and its internal state if it is not None.

proj_map f init merge map is a map mapping each element b to the result of the itteration of the function merge over the image in map of the element a in f such that f(a)=b, starting with the element init.

proj_set f set is the set {f(a) | a\in S}

propagate_constant updated_vars overwrite_vars env

Deserialize JSON data of type Locality.t.

Input JSON data of type User_graph.connected_component.

Input JSON data of type Data.din.

Input JSON data of type Primitives.din_kind.

Input JSON data of type Data.plot.

Input JSON data of type Locality.t.

Input JSON data of type Data.snapshot.

Input JSON data of type Trace.step.

Input JSON data of type Counter.Efficiency.t.

Input JSON data of type Nbr.t.

reconstruct domain graph matching_of_previous_cc cc_id_in_rule cc root

reconstruct_renaming domain graph cc root

recti f x n = f (f (f ..

remove the events after the last observable

Some (i,j) as second returned element means separate "new" cc j from cc i

remove_obs_before removes the observable_hits before the simulation info prodided as a first argument

remove_pseudo_inverse_events removes pseudo inverse events

(ids,ty)

not tail rec but don't allocate if unecessary

Deserialize JSON data of type Data.snapshot.

split_init split init event agent-wise

Deserialize JSON data of type Trace.step.

Store trace in story table

Serialize a value of type User_graph.connected_component into a JSON string.

Serialize a value of type Data.din into a JSON string.

Serialize a value of type Primitives.din_kind into a JSON string.

Serialize a value of type Data.plot into a JSON string.

Serialize a value of type Locality.t into a JSON string.

Serialize a value of type Data.snapshot into a JSON string.

Serialize a value of type Trace.step into a JSON string.

Serialize a value of type Counter.Efficiency.t into a JSON string.

Serialize a value of type Nbr.t into a JSON string.

compute the strong compression of a given trace, if parameter.compute_all_stories, then each minimal stories is computed, otherwise, only the first found one is provided; the optional argument heuristic can be used to redefined the heuristic that select which event to try to discard first.

Deserialize JSON data of type Counter.Efficiency.t.

Deserialize JSON data of type Nbr.t.

exported for convenience.

Output on stdout

None when infinity or Not a Number

convert a list of refined steps into a trace

Same than concretize_action, except that it returns None if the provided injection's domain does not contain a fresh agent that is involved in the action that is being concretized.