2010 2nd International Conference on Software Technology and Engineering 2010
DOI: 10.1109/icste.2010.5608905
|View full text |Cite
|
Sign up to set email alerts
|

On the verification of business processes by model checking techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
8
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 11 publications
0
8
0
Order By: Relevance
“…Because of the invariant in the calculate location, TE n is forced to change to the location from calculate to firing at the moment that the time t exe has elapsed (Line 20). The firing process of a node is defined by the outgoing edges and the node type (Lines [22][23][24][25][26][27][28]. An outgoing edge is translated into three transitions.…”
Section: Distributed Control Translationmentioning
confidence: 99%
See 2 more Smart Citations
“…Because of the invariant in the calculate location, TE n is forced to change to the location from calculate to firing at the moment that the time t exe has elapsed (Line 20). The firing process of a node is defined by the outgoing edges and the node type (Lines [22][23][24][25][26][27][28]. An outgoing edge is translated into three transitions.…”
Section: Distributed Control Translationmentioning
confidence: 99%
“…Ribeiro [21] uses PN to model embedded systems; this approach maps places into global Boolean variables and the entire PN into a flat structure by using a do-statement. A similar approach for business processes is presented by Sbai [22], with the difference that the places are byte-variables, which allows the analysis of data overwriting. Gannod [23] proposes a channel-based approach, which maps places into channels and transitions into processes.…”
mentioning
confidence: 98%
See 1 more Smart Citation
“…Wynn et al [4] verify business processes against four defined properties (soundness, weak soundness, irreducible cancellation regions and immutable OR-joins). Sbai et al [5] show how a model checker can be used to identify problems with a specification of a business process to be automated as a workflow, and how a verification of certain correctness properties can be accomplished. Kherbouche et al [6] propose an approach for using model checking as a mechanism to detect errors such as deadlocks or lifelocks.…”
Section: Related Workmentioning
confidence: 99%
“…Wynn et al [17] verify business processes against four defined properties (soundness, weak soundness, irreducible cancellation regions and immutable OR-joins). Sbai et al [13] show how a model checker can be used to identify problems with a specification of a business process to be automated as a workflow, and how a verification of certain correctness properties can be accomplished.…”
Section: Related Workmentioning
confidence: 99%