Matthias Jantzen, Manfred Kudlek, and Georg Zetzsche.
Concurrent finite automata.
In Manfred Droste and Markus Lohrey, editors, Tagungsband 17.
Theorietag Automaten und Formale Sprachen, pages 84-88, 2007.
We present a generalization of finite automata using Petri nets as control. Acceptance is defined by final markings of the Petri net. The class of languages obtained by $\lambda$-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined by final marking.
@INPROCEEDINGS{Jantzen+07b, AUTHOR = {Jantzen, Matthias and Kudlek, Manfred and Zetzsche, Georg}, TITLE = {Concurrent Finite Automata}, EDITOR = {Droste, Manfred and Lohrey, Markus}, BOOKTITLE = {Tagungsband 17. Theorietag Automaten und Formale Sprachen}, PAGES = {84--88}, YEAR = 2007, ABSTRACT = {We present a generalization of finite automata using Petri nets as control. Acceptance is defined by final markings of the Petri net. The class of languages obtained by $\lambda$-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined by final marking.} }