| definition: |
flElemS :: (Node,Node) -> Grappa BPMNComp BPELComp
flElemS (n1,n2) = translateInter itype name <$
edge (BPMNInter itype name, [n1,n2])
where itype,name free
translateInter BPMNWait = Wait
translateInter BPMNReceive = Receive
flElemS (n1,n2) = Invoke lab <$
edge (BPMNActivity lab, [n1,n2])
where lab free
flElemS (n1,n2) = edge (BPMNPGW, [n1,n1t,n1r,n1b]) *>
(Flow <$>
flowS (n1t,n2t) <*>
flowS (n1b,n2b)) <*
edge (BPMNPGW, [n2l,n2t,n2,n2b])
where n1t,n1r,n1b,n2l,n2t,n2b free
flElemS (n1,n2) = edge (BPMNXGW c1 c2, [n1,n1t,n1r,n1b]) *>
(Switch c1 c2 <$>
flowS (n1t,n2t) <*>
flowS (n1b,n2b)) <*
edge (BPMNXGW d1 d2, [n2l,n2t,n2,n2b])
where c1,c2,d1,d2,n1t,n1r,n1b,n2l,n2t,n2b free
|
| demand: |
argument 1 |
| deterministic: |
possibly non-deterministic operation |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({(,)}) |-> {<*>}}
|
| name: |
flElemS |
| precedence: |
no precedence defined |
| result-values: |
{<*>}
|
| signature: |
(Prelude.Int, Prelude.Int) -> [(BPMNComp, [Prelude.Int])] -> (BPELComp, [(BPMNComp, [Prelude.Int])]) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |