Bibliography

Labeled Step Sequences in Petri Nets

Matthias Jantzen and Georg Zetzsche.
Labeled step sequences in Petri nets.
In Kees M. van Hee and Rüdiger Valk, editors, Applications and Theory of Petri Nets, 29th International Conference, PETRI NETS 2008, Xi'an, China, June 23-27, 2008. Proceedings, volume 5062 of Lecture Notes in Computer Science, pages 270-287, Berlin, Heidelberg, New York, 2008. Springer-Verlag.

We compare various modes of firing transitions in Petri nets and define classes of languages defined this way. We define languages through steps, i. e. sets of transitions, maximal steps, multi-steps, and maximal multi-steps of transitions in Petri nets, but in a different manner than those defined in [Burk 81a,Burk 83], by considering labeled transitions. We will show that we obtain a hierarchy of families of languages defined by multiple use of transition in firing transitions in a single multistep. Except for the maximal multi-steps all classes can be simulated by sequential firing of transitions.

BibTeX

@INPROCEEDINGS{Jantzen+08a,
  AUTHOR    = {Jantzen, Matthias and
               Zetzsche, Georg},
  TITLE     = {Labeled Step Sequences in {Petri} Nets},
  BOOKTITLE = {Applications and Theory of Petri Nets, 29th International
               Conference, PETRI NETS 2008, Xi'an, China, June 23-27, 2008.
               Proceedings},
  ADDRESS   = Springer.addr,
  YEAR      = 2008,
  PAGES     = {270--287},
  EDITOR    = {van Hee, Kees M. and
               Valk, R{\"u}diger},
  PUBLISHER = Springer,
  VOLUME    = 5062,
  SERIES    = LNCS,
  ABSTRACT  = {We compare various modes of firing transitions in Petri nets
               and define classes of languages defined this way.  We define
               languages through steps, i. e. sets of transitions, maximal
               steps, multi-steps, and maximal multi-steps of transitions
               in Petri nets, but in a different manner than those defined
               in [Burk 81a,Burk 83], by considering labeled transitions.
               We will show that we obtain a hierarchy of families of
               languages defined by multiple use of transition in firing
               transitions in a single multistep.  Except for the maximal
               multi-steps all classes can be simulated by sequential
               firing of transitions.}
}