Unified Mathematical Framework for Slicing and Symmetry Reduction over Event Structures

Algorithm 2

Slicing algorithm: 𝑚𝑐𝑓𝐸𝑆𝑠𝑙𝑖𝑐𝑒(𝑚𝑐𝑓𝐸𝑆(ℰ),𝜑).

 Input:

(1) a conflict-free event structure: 𝑚𝑐𝑓𝐸𝑆(ℰ),

(2) a regular predicate: 𝜑

 Output: the slice of 𝑚𝑐𝑓𝐸𝑆: ℰ_𝑖^max_{𝑠𝑙𝑖𝑐𝑒}

 BEGIN

(1) 𝐾=∅;

(2) generate graph representation 𝐺 for ℰ_𝑖^max;

(3) computing slice: 𝐾=𝑠𝑙𝑖𝑐𝑒(𝐺,𝜑);

(4) generate event structure ℰ_𝑖^max_{𝑠𝑙𝑖𝑐𝑒} from graph representation 𝐾;

(5) return ℰ_𝑖^max_{𝑠𝑙𝑖𝑐𝑒};

 END