Table 1 Comparison of existing work with proposed work
From: A verification strategy for web services composition using enhanced stacked automata model
S. No | Researchers | Formal model | Transformation verification | Â | Type of system | Specification | Tool used | Level of development | ||
|---|---|---|---|---|---|---|---|---|---|---|
Correctness property | Safetyness | Dead transition | Deadlock | |||||||
1 | M.Emilia Cambronero | Timed Automata | No | No | No | No | Deterministic System | WSCDL | WST and UPPAAL | Design Level |
2 | Jia Mei | Interface Automata | No | No | No | No | Deterministic System | BPEL, Promela | SPIN | Implementation Level |
3 | Jin Song Dong | Orchestration on computation via Timed automata | No | No | No | No | Deterministic System | LTL | UPPAAL | Design Level |
4 | Valentin Valero | Colored Petrinet Method | Yes | Partial | Partial | No | Deterministic System | BPEL | CPN | Implementation Level |
5 | Guangquan Zhang | Refinement Checking Method | Yes | No | No | No | Deterministic System | BPEL | UPPAAL | Design Level |
6 | Our Work | Modified Muller Automata | Yes | Yes | Yes | Yes | Both Deterministic and non-Deterministic System | WSCDL | - | Implementation Level |