2011
DOI: 10.1016/j.phpro.2011.11.102
|View full text |Cite
|
Sign up to set email alerts
|

The Detection and Prevention of Deadlock in Petri Nets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 1 publication
0
3
0
Order By: Relevance
“…The aisle space in a factory is limited, and two-way traffic is usually present in a single lane. Collisions must be avoided when multiple vehicles are moving at the same time [24][25][26]. When we integrate the aforementioned technologies for unmanned vehicle systems, there are some main challenges.…”
Section: Purposementioning
confidence: 99%
“…The aisle space in a factory is limited, and two-way traffic is usually present in a single lane. Collisions must be avoided when multiple vehicles are moving at the same time [24][25][26]. When we integrate the aforementioned technologies for unmanned vehicle systems, there are some main challenges.…”
Section: Purposementioning
confidence: 99%
“…The way this central deadlock avoidance can be included in the optimization can be done in different ways. Petri nets [84] are a frequently used approach for deadlock avoidance in central motion planning. A Petri net, or a place/transition net, is a graphical tool to represent systems with concurrency.…”
Section: Deadlock Avoidancementioning
confidence: 99%
“…It was said in [26] that if M 0 is initial marking of N then in (N, M 0 ) is a deadlock only on the condition that t ∈ T : M 0 [t⟩ is never found.…”
Section: Siphons Traps Deadlocks Invariants Repetitive and Characteristic Vectorsmentioning
confidence: 99%