For the most recent entries see the Petri Nets Newsletter.

Weighted Basic Petri Nets.

Best, E.

In: Vogt, F.H.: Lecture Notes in Computer Science, Vol. 335; Concurrency 88, pages 257-276. Berlin, Heidelberg, New York: Springer-Verlag, 1988.

Abstract: Basic net systems are proposed as an infinitary Petri net model which is sufficiently restrictive to allow essentially the same theory as finite nets, yet also powerful enough to describe the basic semantics of many concepts of concurrent programming languages. Wheighted basic net systems are obtained if widths are assigned to the places and lengths are assigned to the transitions of a basic system. Using this enriched model run-time quantities such as space and time bounds can be derived.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography