2025-06-19 23:48:16 +02:00
|
|
|
#![allow(dead_code)]
|
|
|
|
|
|
|
|
|
|
use super::classical::compute_all_owned;
|
|
|
|
|
use super::translator::IdType;
|
2025-06-22 16:09:31 +02:00
|
|
|
use super::structure::{RSenvironment, RSprocess, RSreaction, RSset, RSsystem};
|
2025-06-19 23:48:16 +02:00
|
|
|
|
2025-06-20 17:11:00 +02:00
|
|
|
|
|
|
|
|
// returns the prefix and the loop from a trace
|
2025-06-22 16:09:31 +02:00
|
|
|
fn split<'a>(
|
|
|
|
|
set: &'a RSset,
|
|
|
|
|
trace: &'a [RSset]
|
|
|
|
|
) -> Option<(&'a[RSset], &'a[RSset])> {
|
2025-06-19 23:48:16 +02:00
|
|
|
let position = trace.iter().rposition(|x| x == set);
|
|
|
|
|
position.map(|pos| trace.split_at(pos))
|
|
|
|
|
}
|
|
|
|
|
|
2025-06-20 17:11:00 +02:00
|
|
|
// finds the loops by simulating the system
|
2025-06-22 16:09:31 +02:00
|
|
|
fn find_loop(
|
|
|
|
|
rs: &[RSreaction],
|
|
|
|
|
entities: RSset,
|
|
|
|
|
q: &RSset
|
|
|
|
|
) -> (Vec<RSset>, Vec<RSset>) {
|
2025-06-20 17:11:00 +02:00
|
|
|
let mut entities = entities;
|
2025-06-19 23:48:16 +02:00
|
|
|
let mut trace = vec![];
|
|
|
|
|
loop {
|
2025-06-20 17:11:00 +02:00
|
|
|
if let Some((prefix, hoop)) = split(&entities, &trace) {
|
2025-06-19 23:48:16 +02:00
|
|
|
return (prefix.to_vec(), hoop.to_vec());
|
|
|
|
|
} else {
|
2025-06-20 17:11:00 +02:00
|
|
|
let t = entities.union(q);
|
|
|
|
|
let products = compute_all_owned(&t, rs);
|
|
|
|
|
trace.push(entities.clone());
|
|
|
|
|
entities = products;
|
2025-06-19 23:48:16 +02:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2025-06-22 16:09:31 +02:00
|
|
|
|
2025-06-20 17:11:00 +02:00
|
|
|
// finds the loops by simulating the system
|
2025-06-22 16:09:31 +02:00
|
|
|
fn find_only_loop(rs: &[RSreaction], entities: RSset, q: &RSset) -> Vec<RSset> {
|
2025-06-20 17:11:00 +02:00
|
|
|
let mut entities = entities;
|
|
|
|
|
let mut trace = vec![];
|
|
|
|
|
loop {
|
|
|
|
|
if let Some((_prefix, hoop)) = split(&entities, &trace) {
|
|
|
|
|
return hoop.to_vec();
|
|
|
|
|
} else {
|
|
|
|
|
let t = entities.union(q);
|
|
|
|
|
let products = compute_all_owned(&t, rs);
|
|
|
|
|
trace.push(entities.clone());
|
|
|
|
|
entities = products;
|
2025-06-19 23:48:16 +02:00
|
|
|
}
|
|
|
|
|
}
|
2025-06-20 17:11:00 +02:00
|
|
|
}
|
2025-06-19 23:48:16 +02:00
|
|
|
|
2025-06-22 16:09:31 +02:00
|
|
|
|
|
|
|
|
// finds the loops and the length of the prefix by simulating the system
|
|
|
|
|
fn find_prefix_len_loop(
|
|
|
|
|
rs: &[RSreaction],
|
|
|
|
|
entities: RSset,
|
|
|
|
|
q: &RSset
|
|
|
|
|
) -> (usize, Vec<RSset>) {
|
|
|
|
|
let mut entities = entities;
|
|
|
|
|
let mut trace = vec![];
|
|
|
|
|
loop {
|
|
|
|
|
if let Some((prefix, hoop)) = split(&entities, &trace) {
|
|
|
|
|
return (prefix.len(), hoop.to_vec());
|
|
|
|
|
} else {
|
|
|
|
|
let t = entities.union(q);
|
|
|
|
|
let products = compute_all_owned(&t, rs);
|
|
|
|
|
trace.push(entities.clone());
|
|
|
|
|
entities = products;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
// finds only the rules X = pre(Q, rec(X)), but not only x = pre(Q, rec(x))
|
|
|
|
|
// to use in filter_map
|
|
|
|
|
fn filter_delta<'a>(x: (&IdType, &'a RSprocess)) -> Option<&'a RSset> {
|
|
|
|
|
use super::structure::RSprocess::*;
|
|
|
|
|
let (id, rest) = x;
|
2025-06-24 18:56:04 +02:00
|
|
|
|
|
|
|
|
if let EntitySet{ entities, next_process} = rest {
|
|
|
|
|
if let RecursiveIdentifier{ identifier } = &**next_process {
|
|
|
|
|
if identifier == id {
|
|
|
|
|
return Some(entities);
|
2025-06-22 16:09:31 +02:00
|
|
|
}
|
2025-06-24 18:56:04 +02:00
|
|
|
}
|
2025-06-22 16:09:31 +02:00
|
|
|
}
|
2025-06-24 18:56:04 +02:00
|
|
|
None
|
2025-06-22 16:09:31 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2025-06-20 17:11:00 +02:00
|
|
|
// see lollipop
|
2025-06-22 16:09:31 +02:00
|
|
|
pub fn lollipops_decomposed(
|
|
|
|
|
delta: &RSenvironment,
|
|
|
|
|
reaction_rules: &[RSreaction],
|
|
|
|
|
available_entities: &RSset
|
|
|
|
|
) -> Vec<(Vec<RSset>, Vec<RSset>)> {
|
2025-06-20 17:11:00 +02:00
|
|
|
// FIXME: i think we are only interested in "x", not all symbols that
|
2025-06-19 23:48:16 +02:00
|
|
|
// satisfy X = pre(Q, rec(X))
|
2025-06-22 16:09:31 +02:00
|
|
|
let filtered = delta.iter().filter_map(filter_delta);
|
2025-06-19 23:48:16 +02:00
|
|
|
|
2025-06-22 16:09:31 +02:00
|
|
|
let find_loop_fn = |q| find_loop(reaction_rules,
|
|
|
|
|
available_entities.clone(),
|
2025-06-20 17:11:00 +02:00
|
|
|
q);
|
|
|
|
|
|
|
|
|
|
filtered.map(find_loop_fn).collect::<Vec<_>>()
|
|
|
|
|
}
|
|
|
|
|
|
2025-06-22 16:09:31 +02:00
|
|
|
// see lollipop
|
|
|
|
|
pub fn lollipops(system: RSsystem) -> Vec<(Vec<RSset>, Vec<RSset>)> {
|
|
|
|
|
lollipops_decomposed(system.get_delta(),
|
|
|
|
|
system.get_reaction_rules(),
|
|
|
|
|
system.get_available_entities())
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// see loop
|
2025-06-20 17:11:00 +02:00
|
|
|
pub fn lollipops_only_loop(system: RSsystem) -> Vec<Vec<RSset>> {
|
|
|
|
|
// FIXME: i think we are only interested in "x", not all symbols that
|
|
|
|
|
// satisfy X = pre(Q, rec(X))
|
|
|
|
|
let filtered = system.get_delta().iter().filter_map(filter_delta);
|
|
|
|
|
|
|
|
|
|
let find_loop_fn = |q| find_only_loop(system.get_reaction_rules(),
|
|
|
|
|
system.get_available_entities().clone(),
|
|
|
|
|
q);
|
|
|
|
|
|
|
|
|
|
filtered.map(find_loop_fn).collect::<Vec<_>>()
|
2025-06-19 23:48:16 +02:00
|
|
|
}
|
2025-06-22 16:09:31 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn lollipops_prefix_len_loop_decomposed(
|
|
|
|
|
delta: &RSenvironment,
|
|
|
|
|
reaction_rules: &[RSreaction],
|
|
|
|
|
available_entities: &RSset
|
|
|
|
|
) -> Vec<(usize, Vec<RSset>)> {
|
|
|
|
|
// FIXME: i think we are only interested in "x", not all symbols that
|
|
|
|
|
// satisfy X = pre(Q, rec(X))
|
|
|
|
|
let filtered = delta.iter().filter_map(filter_delta);
|
|
|
|
|
|
|
|
|
|
let find_loop_fn = |q| find_prefix_len_loop(reaction_rules,
|
|
|
|
|
available_entities.clone(),
|
|
|
|
|
q);
|
|
|
|
|
|
|
|
|
|
filtered.map(find_loop_fn).collect::<Vec<_>>()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// see loop
|
|
|
|
|
pub fn lollipops_only_loop_decomposed(
|
|
|
|
|
delta: &RSenvironment,
|
|
|
|
|
reaction_rules: &[RSreaction],
|
|
|
|
|
available_entities: &RSset
|
|
|
|
|
) -> Vec<Vec<RSset>> {
|
|
|
|
|
// FIXME: i think we are only interested in "x", not all symbols that
|
|
|
|
|
// satisfy X = pre(Q, rec(X))
|
|
|
|
|
let filtered = delta.iter().filter_map(filter_delta);
|
|
|
|
|
|
|
|
|
|
let find_loop_fn = |q| find_only_loop(reaction_rules,
|
|
|
|
|
available_entities.clone(),
|
|
|
|
|
q);
|
|
|
|
|
|
|
|
|
|
filtered.map(find_loop_fn).collect::<Vec<_>>()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
|
// Named versions
|
|
|
|
|
// -----------------------------------------------------------------------------
|
|
|
|
|
|
|
|
|
|
// finds only the rules symb = pre(Q, rec(symb)), get symb from a translator
|
|
|
|
|
// to use in filter_map
|
|
|
|
|
fn filter_delta_named<'a>(
|
|
|
|
|
x: (&IdType, &'a RSprocess),
|
|
|
|
|
symb: &IdType
|
|
|
|
|
) -> Option<&'a RSset> {
|
|
|
|
|
use super::structure::RSprocess::*;
|
|
|
|
|
let (id, rest) = x;
|
|
|
|
|
if id != symb {
|
|
|
|
|
return None;
|
|
|
|
|
}
|
2025-06-24 18:56:04 +02:00
|
|
|
|
|
|
|
|
if let EntitySet{ entities, next_process} = rest {
|
|
|
|
|
if let RecursiveIdentifier{ identifier } = &**next_process {
|
|
|
|
|
if identifier == id {
|
|
|
|
|
return Some(entities);
|
2025-06-22 16:09:31 +02:00
|
|
|
}
|
2025-06-24 18:56:04 +02:00
|
|
|
}
|
2025-06-22 16:09:31 +02:00
|
|
|
}
|
2025-06-24 18:56:04 +02:00
|
|
|
None
|
2025-06-22 16:09:31 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// see lollipop
|
|
|
|
|
pub fn lollipops_decomposed_named(
|
|
|
|
|
delta: &RSenvironment,
|
|
|
|
|
reaction_rules: &[RSreaction],
|
|
|
|
|
available_entities: &RSset,
|
|
|
|
|
symb: IdType
|
|
|
|
|
) -> Option<(Vec<RSset>, Vec<RSset>)> {
|
|
|
|
|
let filtered = delta.iter().filter_map(|x| filter_delta_named(x, &symb)).next();
|
|
|
|
|
|
|
|
|
|
let find_loop_fn = |q| find_loop(reaction_rules,
|
|
|
|
|
available_entities.clone(),
|
|
|
|
|
q);
|
|
|
|
|
|
|
|
|
|
filtered.map(find_loop_fn)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// see lollipop
|
|
|
|
|
pub fn lollipops_named(
|
|
|
|
|
system: RSsystem,
|
|
|
|
|
symb: IdType
|
|
|
|
|
) -> Option<(Vec<RSset>, Vec<RSset>)> {
|
|
|
|
|
lollipops_decomposed_named(system.get_delta(),
|
|
|
|
|
system.get_reaction_rules(),
|
|
|
|
|
system.get_available_entities(),
|
|
|
|
|
symb)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// see loop
|
|
|
|
|
pub fn lollipops_only_loop_named(
|
|
|
|
|
system: RSsystem,
|
|
|
|
|
symb: IdType
|
|
|
|
|
) -> Option<Vec<RSset>> {
|
|
|
|
|
let filtered = system.get_delta().iter()
|
|
|
|
|
.filter_map(|x| filter_delta_named(x, &symb)).next();
|
|
|
|
|
|
|
|
|
|
let find_loop_fn =
|
|
|
|
|
|q| find_only_loop(system.get_reaction_rules(),
|
|
|
|
|
system.get_available_entities().clone(),
|
|
|
|
|
q);
|
|
|
|
|
|
|
|
|
|
filtered.map(find_loop_fn)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pub fn lollipops_prefix_len_loop_decomposed_named(
|
|
|
|
|
delta: &RSenvironment,
|
|
|
|
|
reaction_rules: &[RSreaction],
|
|
|
|
|
available_entities: &RSset,
|
|
|
|
|
symb: IdType
|
|
|
|
|
) -> Option<(usize, Vec<RSset>)> {
|
|
|
|
|
let filtered = delta.iter()
|
|
|
|
|
.filter_map(|x| filter_delta_named(x, &symb)).next();
|
|
|
|
|
|
|
|
|
|
let find_loop_fn = |q| find_prefix_len_loop(reaction_rules,
|
|
|
|
|
available_entities.clone(),
|
|
|
|
|
q);
|
|
|
|
|
|
|
|
|
|
filtered.map(find_loop_fn)
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// see loop
|
|
|
|
|
pub fn lollipops_only_loop_decomposed_named(
|
|
|
|
|
delta: &RSenvironment,
|
|
|
|
|
reaction_rules: &[RSreaction],
|
|
|
|
|
available_entities: &RSset,
|
|
|
|
|
symb: IdType
|
|
|
|
|
) -> Option<Vec<RSset>> {
|
|
|
|
|
let filtered = delta.iter()
|
|
|
|
|
.filter_map(|x| filter_delta_named(x, &symb)).next();
|
|
|
|
|
|
|
|
|
|
let find_loop_fn = |q| find_only_loop(reaction_rules,
|
|
|
|
|
available_entities.clone(),
|
|
|
|
|
q);
|
|
|
|
|
|
|
|
|
|
filtered.map(find_loop_fn)
|
|
|
|
|
}
|
2025-06-24 18:56:04 +02:00
|
|
|
|
|
|
|
|
// see loop/5
|
|
|
|
|
pub fn lollipops_only_loop_decomposed_q(
|
|
|
|
|
q: &RSset,
|
|
|
|
|
reaction_rules: &[RSreaction],
|
|
|
|
|
available_entities: &RSset,
|
|
|
|
|
) -> Vec<RSset> {
|
|
|
|
|
let find_loop_fn = |q| find_only_loop(reaction_rules,
|
|
|
|
|
available_entities.clone(),
|
|
|
|
|
q);
|
|
|
|
|
|
|
|
|
|
find_loop_fn(q)
|
|
|
|
|
}
|