2018
DOI: 10.1109/tii.2017.2779177
|View full text |Cite
|
Sign up to set email alerts
|

Automatic Procedure Following Evaluation Using Petri Net-Based Workflows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 25 publications
0
4
0
Order By: Relevance
“…Theorem 1: The Edge-rewritable Petri net EN is soundness if the extended workflow [31] of EN is liveness and boundedness [14].…”
Section: The Soundness Of the System Frameworkmentioning
confidence: 99%
“…Theorem 1: The Edge-rewritable Petri net EN is soundness if the extended workflow [31] of EN is liveness and boundedness [14].…”
Section: The Soundness Of the System Frameworkmentioning
confidence: 99%
“…Theorem 1 The edge rewritable petri net EN is soundness if the extended workflow [17] of EN is liveness and boundedness [16].…”
Section: Tablementioning
confidence: 99%
“…In this case, it is considered that consistency in the graph of transitions is ensured if simultaneous transitions along any two or more arcs emanating from one vertex are prohibited in it [10,11].…”
Section: The Matrix Algorithmmentioning
confidence: 99%