bpmncheck 0.3.0

A library to sanity-check Business Process Model Notation models
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152

/*
Copyright 2025 Erwan Mahe (github.com/erwanM974)

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/




use std::{collections::{BTreeMap, BTreeSet, HashSet}, rc::Rc};

use citreelo::ctl::{BinaryCTLOperator, CTLFormula, CTLFormulaLeaf, UnaryCTLOperator};
use petricheck::{model::label::PetriTransitionLabel, model_checking::props::BuiltinPetriAtomicProposition};

#[derive(Default)]
struct TrieNode {
    children: BTreeMap<String, TrieNode>,
    is_terminal: bool,
}

fn insert_trace(root: &mut TrieNode, trace: &[String]) {
    let mut node = root;
    for label in trace {
        node = node.children.entry(label.clone()).or_default();
    }
    node.is_terminal = true;
}

fn build_trie(traces: &HashSet<Vec<String>>) -> TrieNode {
    let mut root = TrieNode::default();
    for trace in traces {
        insert_trace(&mut root, trace);
    }
    root
}

fn complement(alphabet: &BTreeSet<String>, keep: &BTreeSet<String>) -> Option<CTLFormula<BuiltinPetriAtomicProposition>> {
    let excluded: Vec<_> = alphabet
        .difference(keep)
        .map(|x| 
            CTLFormula::Leaf(
                CTLFormulaLeaf::AtomicProp(
                    BuiltinPetriAtomicProposition::PreviousTransitionLabelMustBe(Rc::new(PetriTransitionLabel::new(x.to_string())))
                )
            )
        )
        .collect();
    if excluded.is_empty() {
        None
    } else {
        let ctl_or = excluded
        .into_iter()
        .reduce(|x, y| {
            CTLFormula::Binary(
                BinaryCTLOperator::Or,
                Box::new(x),
                Box::new(y),
            )
        }).unwrap();
        Some(CTLFormula::Unary(UnaryCTLOperator::Not, Box::new(ctl_or)))
    }
}

fn ctl_from_trie(
    previous : Option<String>,
    node: &TrieNode,
    alphabet: &BTreeSet<String>,
) -> CTLFormula<BuiltinPetriAtomicProposition> {
    // If no children, we’ve fully matched a trace
    if node.children.is_empty() {
        return CTLFormula::Leaf(CTLFormulaLeaf::True);
    }

    let mut branches = Vec::new();

    for (label, child) in &node.children {
        let mut keep = BTreeSet::new();
        keep.insert(label.clone());
        if let Some(prev_lab) = &previous {
            keep.insert(prev_lab.clone());
        }

        let wait = complement(alphabet, &keep);
        let next = ctl_from_trie(Some(label.clone()),child, alphabet);

        let reach = CTLFormula::Leaf(
            CTLFormulaLeaf::AtomicProp(
                BuiltinPetriAtomicProposition::PreviousTransitionLabelMustBe(Rc::new(PetriTransitionLabel::new(label.to_string())))
            )
        );
        let branch = if next == CTLFormula::Leaf(CTLFormulaLeaf::True) {
            match wait {
                None => {
                    CTLFormula::Unary(UnaryCTLOperator::EF, Box::new(reach))
                },
                Some(got_wait) => {
                    CTLFormula::Binary(BinaryCTLOperator::EU, Box::new(got_wait), Box::new(reach))
                }
            }
        } else {
            let reach_and_next = CTLFormula::Binary(
                BinaryCTLOperator::And, 
                Box::new(reach), 
                Box::new(next)
            );
            match wait {
                None => {
                    CTLFormula::Unary(UnaryCTLOperator::EF, Box::new(reach_and_next))
                },
                Some(got_wait) => {
                    CTLFormula::Binary(BinaryCTLOperator::EU, Box::new(got_wait), Box::new(reach_and_next))
                }
            }
        };

        branches.push(branch);
    }

    if branches.len() == 1 {
        branches[0].clone()
    } else {
        branches
        .into_iter()
        .reduce(|x, y| {
            CTLFormula::Binary(
                BinaryCTLOperator::Or,
                Box::new(x),
                Box::new(y),
            )
        }).unwrap()
    }
}

pub fn traces_to_ctl(
    traces: HashSet<Vec<String>>,
    alphabet: BTreeSet<String>,
) -> CTLFormula<BuiltinPetriAtomicProposition> {
    let trie = build_trie(&traces);
    ctl_from_trie(None,&trie, &alphabet)
}