ccs 0.1.0

A simple implementation of the Calculus of Communicating Systems by Robin Milner
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

use std::fs;

use crate::{bisimilarity::{self, AlgorithmChoice}, parser};


fn compare_bisimulation_impls(file: &str) {
    let contents = fs::read_to_string(file).unwrap();
    let system = parser::parse(file.to_string(), &contents).unwrap();

    let mut fix: Vec<_> = bisimilarity::bisimulation(&system, AlgorithmChoice::Naive, true).0.unwrap()
        .into_iter()
        .map(|(p, q)| (p.to_string(), q.to_string()))
        .collect();
    let mut pt: Vec<_> = bisimilarity::bisimulation(&system, AlgorithmChoice::PaigeTarjan, true).0.unwrap()
        .into_iter()
        .map(|(p, q)| (p.to_string(), q.to_string()))
        .collect();
    fix.sort();
    pt.sort();
    assert_eq!(fix.len(), pt.len(), "[{}]", file);
    assert_eq!(fix, pt, "[{}]", file);
}


#[test]
fn compare_bisimulation() {
    for example in super::EXAMPLES {
        compare_bisimulation_impls(example)
    }
}

#[test]
#[ntest::timeout(10000)]
fn big_bisimulation() {
    let file = "examples/bisimbench_25k_25k.ccs";
    let contents = fs::read_to_string(file).unwrap();
    let system = parser::parse(file.to_string(), &contents).unwrap();

    bisimilarity::bisimulation(&system, AlgorithmChoice::PaigeTarjan, false);
}

#[test]
#[cfg(feature = "very_big_test")]
#[ntest::timeout(80000)]
fn very_big_bisimulation() {
    let file = "examples/bisimbench_1M_1M.ccs";
    let contents = fs::read_to_string(file).unwrap();
    let system = parser::parse(file.to_string(), &contents).unwrap();

    bisimilarity::bisimulation(&system, AlgorithmChoice::PaigeTarjan, false);
}