Journal of the ACM Bibliography
L. H. Landweber and E. L. Robertson. Properties
of conflict-free and persistent Petri nets. Journal of the
ACM, 25(3):352-364, July 1978.
[BibTeX entry]
Selected papers that cite this one
- Jörg Desel and Javier Esparza. Shortest paths in
reachability graphs. Journal of Computer and System
Sciences, 51(2):314-323, October 1995.
- Javier Esparza. Model checking using net
unfoldings. Science of Computer Programming,
23(2-3):151-195, December 1994.
- Rodney R. Howell, Petr Jan\v{c}ar, and Louis E. Rosier. Completeness results for
single-path Petri nets. Information and Computation,
106(2):253-265, October 1993.
- Hsu-Chun Yen. A unified
approach for deciding the existence of certain Petri net paths.
Information and Computation, 96(1):119-137, January 1992.
- Hsu-Chun Yen. On the
regularity of Petri net languages. Information and
Computation, 124(2):168-181, 1 February 1996.
- Hsu-Chun Yen, Bow-Yaw Wang, and Ming-Sheng Yang. Deciding a class of path
formulas for conflict-free Petri nets. Theory of Computing
Systems, 30(5):475-494, September/October 1997.
Shortcuts: