@INPROCEEDINGS{grahlmann_moeller_anhalt:10/95,
        AUTHOR             = {Bernd Grahlmann and Matthias Moeller and Ulrich Anhalt},
        BOOKTITLE          = {{Proceedings of AWPN'95 (2. Workshop Algorithmen und Werkzeuge f{\"u}r Petrinetze)}},
        EDITOR             = {J. Desel and H. Fleischhack and A. Oberweis and W. Reisig},
        MONTH              = oct,
        NUMBER             = {{22}},
        PAGES              = {{21--26}},
        PUBLISHER          = {{FB Informatik Universit{\"a}t Oldenburg}},
        SERIES             = {{AIS}},
        TITLE              = {{A New Interface for the PEP Tool -- Parallel Finite Automata --}},
        YEAR               = {{1995}},
        ABSTRACT           = {
This paper introduces a special kind of parallel
finite automata (PFA) with B(PN){$^2$} actions as edge
annotations.  An algorithm for the automatic translation
into a B(PN){$^2$} program is described. The algorithm
is non-trivial because the structure of a PFA is
preserved in the generated B(PN){$^2$} 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){$^2$}
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){$^2$},
                              Finite automata, PEP.}
}