For the most recent entries see the Petri Nets Newsletter.

A new Interface for the PEP tool - Parallel Finite Automata.

Grahlmann, B.; Moeller, M.; Anhalt, U.

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 21-26. Fachbereich Informatik, Universität Oldenburg, October 1995. Available at

Abstract: This paper introduces a special kind of parallel finite automata (PFA) with B(PN) actions as edge annotations. An algorithm for the automatic translation into a B(PN) program is described. The algorithm is non-trivial because the structure of a PFA is preserved in the generated B(PN) program. The modelling of the `Alternating-Bit' protocol using the parallel composition of four finite automata (FA) is considered as an example. The resulting B(PN) program can be used directly as an input for the current version of the PEP tool. Thus one further input interface is provided to the user of the tool.

Keywords: alternating-bit-protocol; B(PN); finite automata; PEP.

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

Back to the Petri Nets Bibliography