2017
DOI: 10.1109/tsc.2016.2605090
|View full text |Cite
|
Sign up to set email alerts
|

On the Verification of Opacity in Web Services and Their Composition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(28 citation statements)
references
References 28 publications
0
26
0
Order By: Relevance
“…Petri nets provide a very expressive language that is frequently used to model parallel systems and could be suitable to formalize the composition of Web Services. For that reason, many attempts of using Petri nets to formalize different subsets of BPEL have been introduced in [20], [21], [22], [23], [24], [25], [26], [27], [28], [29] and [30] . A formalization of a more complete subset of BPEL, including exception handling and compensations, using Petri net could be find in [25].…”
Section: Related Workmentioning
confidence: 99%
“…Petri nets provide a very expressive language that is frequently used to model parallel systems and could be suitable to formalize the composition of Web Services. For that reason, many attempts of using Petri nets to formalize different subsets of BPEL have been introduced in [20], [21], [22], [23], [24], [25], [26], [27], [28], [29] and [30] . A formalization of a more complete subset of BPEL, including exception handling and compensations, using Petri net could be find in [25].…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, an intrusion-tolerant approach is used as a counter-measure for the selected services to define the security attacks. The latter exploits the vulnerabilities that are not identified by the WS-attacker; and Bourouis et al (2016) seek to focus not only on WS protecting but also on proving this privacy based on the verification of security property opacity. Therefore, they define three types of WS opacity, namely, simple, K-type weak and K-type strong opacity.…”
Section: State Of the Artmentioning
confidence: 99%
“…Bourouis et al (2016) seek to focus not only on WS protecting but also on proving this privacy based on the verification of security property opacity. Therefore, they define three types of WS opacity, namely, simple, K-type weak and K-type strong opacity.…”
Section: State Of the Artmentioning
confidence: 99%
See 1 more Smart Citation
“…[5]). Particularly, the formulation of user needs is among the most controversial research topics [6], [7], [8]. In fact, a major importance has been given to users, service clients, who are struggling to formalize their increasingly complex needs in an unambiguous way.…”
Section: Introductionmentioning
confidence: 99%