1997
DOI: 10.1109/3468.553226
|View full text |Cite
|
Sign up to set email alerts
|

Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
119
0

Year Published

1998
1998
2021
2021

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 77 publications
(120 citation statements)
references
References 14 publications
1
119
0
Order By: Relevance
“…In complex models, distant split-join pairs can be quite difficult to trace. In general such interdependencies can be analyzed using the reachability graph, but many analyses can be performed also structurally (see [29]). Experts modelers tend to use structural heuristics for investigating the behavior of a process model.…”
Section: B Factors Of Process Model Understandingmentioning
confidence: 99%
“…In complex models, distant split-join pairs can be quite difficult to trace. In general such interdependencies can be analyzed using the reachability graph, but many analyses can be performed also structurally (see [29]). Experts modelers tend to use structural heuristics for investigating the behavior of a process model.…”
Section: B Factors Of Process Model Understandingmentioning
confidence: 99%
“…In FA nets there is only one configuration matrix and it is square. Furthermore, a strongly connected FA net is Ct iff it is Cv (Teruel, Colom & Silva (1997)), thus, ∀λ it is λ-Ct iff it is λ-Cv. In such case, closedform expressions for basis for P-and T-semiflows can be obtained.…”
Section: Choice-free and Fork-attribution Netsmentioning
confidence: 99%
“…When F is empty, the system is a cycle (Teruel et al, 1997) and measuring one place the system is observable.…”
Section: Attribution Free Petri Netsmentioning
confidence: 99%