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 http://www.informatik.uni-hildesheim.de/~pep.
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.