For the most recent entries see the Petri Nets Newsletter.

Computing a Finite Prefix of a Time Petri Net.

Fleischhack, Hans; Stehno, Christian

In: J. Esparza, C. Lakos (Eds.): Lecture Notes in Computer Science, Vol. 2360: 23rd International Conference on Applications and Theory of Petri Nets, Adelaide, Australia, June 24-30, 2002, pages 1-163pp. Springer Verlag, June 2002.

Abstract: Recently, model checking of Petri nets based on partial order semantics w.r.t. temporal logic formulae has been extended to time Petri nets. In this paper, we present an improved algorithm for computing the McMillan-unfolding of a time Petri net which gives a finite representation of the partial order semantics and some experimental results of its implementation within the PEP tool.

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

Back to the Petri Nets Bibliography