Efficient computerized Petri net approach for the enumeration of the sets of path identifiers for reliability analysis of broadcasting networks
DOI10.1080/00207729008910447zbMATH Open0701.90040OpenAlexW2156465597MaRDI QIDQ3479787FDOQ3479787
Authors: Vinod Kumar, K. K. Aggarwal
Publication date: 1990
Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207729008910447
Recommendations
- Determination of path identifiers for reliability analysis of a broadcasting network using Petri nets
- Applications and Theory of Petri Nets 2004
- scientific article; zbMATH DE number 2112159
- A tabular method for the analysis of large petri nets
- Efficient algorithms for three reachability problems in safe Petri nets
Reliability, availability, maintenance, inspection in operations research (90B25) Stochastic network models in operations research (90B15)
Cites Work
- Title not available (Why is that?)
- State equation, controllability, and maximal matchings of petri nets
- A Unified Formula for Analysis of Some Network Reliability Problems
- An Improved Algorithm for Network Reliability
- Determination of path identifiers for reliability analysis of a broadcasting network using Petri nets
Cited In (1)
This page was built for publication: Efficient computerized Petri net approach for the enumeration of the sets of path identifiers for reliability analysis of broadcasting networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479787)