\(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
From MaRDI portal
Publication:1191025
DOI10.1016/0022-0000(92)90013-9zbMath0788.68048OpenAlexW2043159759MaRDI QIDQ1191025
Publication date: 27 September 1992
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(92)90013-9
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
Determinization of timed Petri nets behaviors ⋮ Deciding a class of path formulas for conflict-free Petri nets ⋮ On the fluidization of Petri nets and marking homothecy
Cites Work
- Fairness and conspiracies
- Fair relation and modified synchronic distances in a Petri net
- Three measures for synchronic dependence in Petri nets
- A fresh look at free choice nets
- On Algorithms for Enumerating All Circuits of a Graph
- Finding All the Elementary Circuits of a Directed Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems