A New Discrete Algorithm for Computing a Reachability Graph of a Weakly Defined Time Petri Net.

For the most recent entries see the Petri Nets Newsletter.

A New Discrete Algorithm for Computing a Reachability Graph of a Weakly Defined Time Petri Net.

In: Desel, J.; Fleischhack, H.; Oberweis, A.; Sonnenschein, M.: AIS-Bericht, No. 22: 2. Workshop Algorithmen und Werkzeuge für Petrinetze, Oldenburg, October 10-11, 1995, pages 4-7. Fachbereich Informatik, Universität Oldenburg, October 1995.

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

Back to the Petri Nets Bibliography