Searching for "Normal and Sinkless Petri Nets." – sorted by Relevance.
-
Normal and Sinkless Petri Nets
- Normal and Sinkless Petri Nets Rodney R. Howell Dept. of Computing and Information Sciences
- Cited by 9 (5 self) – Add To MetaCart
-
Schwer, S. (1992b), The context-freeness of the languages associated with vector addition systems is decidable, Ttzeoret. Uomp. Sci. 98, 199-247.
- ] Howell, R., Rosier, L., and Yen, H. (1993), Normal and sinkless Petri nets, J. Cornput. System Sci. 46
- Add To MetaCart
-
Deciding a Class of Path Formuals for Conflict-Free Petri Nets
- nets, Acta Informa., 21 (1985), 643-674. [31] H. Yamasaki, Normal Petri nets, Theover. Cornput. Sci
- Add To MetaCart
-
Koutny, M., Modelling systems with dynamic priorities, Advances in Petri Nets, pages 251-266, 1992.
- . Howell, R., Rosier, L. and Yen, H., Normal and sinkless Petri nets, Journal of Computer and System
- Add To MetaCart
-
Integer Linear Programming and the Analysis of Some Petri Net Problems
- for the reachability problem, among which are normal and sinkless Petri nets, which were first defined in [19
- Cited by 1 (0 self) – Add To MetaCart
-
The Academic Life of Louis E. Rosier
- ) conflict-free, and more recently, normal and sinkless Petri nets with respect to problems
- Add To MetaCart

