Szczegóły publikacji
Opis bibliograficzny
Deadlock-prone circuits in $S^{3}PR$ Petri nets / Andrei KARATKEVICH, Iwona Grobelna // W: IEEE EUROCON 2025 [Dokument elektroniczny] : 21st international conference on Smart technologies : June 4-6, 2025, Gdynia, Poland : proceedings / eds. Ireneusz Czarnowski, Marek Jasiński. — Wersja do Windows. — Dane tekstowe. — [Piscataway] : Institute of Electrical and Electronics Engineers, cop. 2025. — (International Conference on Computer as a Tool ; ISSN 2837-7990). — Print on Demand (PoD) ISBN: 979-8-3315-0879-1. — e-ISBN: 979-8-3315-0878-4. — S. [1–5]. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. [5], Abstr. — Publikacja dostępna online od: 2025-07-15
Autorzy (2)
- AGHKaratkevich Andrei
- Grobelna Iwona
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 160634 |
|---|---|
| Data dodania do BaDAP | 2025-07-10 |
| Tekst źródłowy | URL |
| DOI | 10.1109/EUROCON64445.2025.11073308 |
| Rok publikacji | 2025 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Wydawca | Institute of Electrical and Electronics Engineers (IEEE) |
| Czasopismo/seria | International Conference on Computer as a Tool |
Abstract
Deadlocks are usually the undesired situations that block the functioning of a concurrent system, e.g., an operating system, an embedded control system, or a flexible manufacturing system. A well-known and popular approach to deadlock detection in parallel systems is based on analysis of the resource flow graphs. The presence of a deadlock implies that there exists a cycle in such a graph, meaning a circular wait. However, such a cycle is a sufficient condition of a deadlock only in some restricted cases (e.g., there should be a single instance of every resource). In general situations, a cycle in a resource flow graph is only a necessary condition of a deadlock. In this paper a notion of a deadlock-prone circuit is introduced, allowing to catch the deadlocks in more general situations than the cycles in the resource flow graph allow.
