scientific article
From MaRDI portal
Publication:3782791
zbMath0641.68081MaRDI QIDQ3782791
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (9)
On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity ⋮ An algorithm to compute the minimal siphons in \(S^4 PR\) nets ⋮ Comparison and evaluation of deadlock prevention methods for different size automated manufacturing systems ⋮ Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors ⋮ Trapping mutual exclusion in the box calculus ⋮ Structure theory of equal conflict systems ⋮ A polynomial-time algorithm to decide liveness of bounded free choice nets ⋮ Extended Elementary Siphons and Their Application to Liveness‐Enforcement of Generalized <scp>P</scp>etri Nets ⋮ A survey of siphons in Petri nets
This page was built for publication:
