2016 International Computer Science and Engineering Conference (ICSEC) 2016
DOI: 10.1109/icsec.2016.7859885
|View full text |Cite
|
Sign up to set email alerts
|

Detecting deadlock in activity diagram using process automata

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Figure illustrates an example. The join node will continue if two incoming flows have arrived . (2) Infinite loops cannot prevent path calculation.…”
Section: A Smardt Test Case Generatormentioning
confidence: 99%
“…Figure illustrates an example. The join node will continue if two incoming flows have arrived . (2) Infinite loops cannot prevent path calculation.…”
Section: A Smardt Test Case Generatormentioning
confidence: 99%