Petri Net Controlled Finite Automata

Berndt Muller, M. Jantzen, M. Kudlek, H. Rölke, G. Zetzsche

Research output: Contribution to journalArticlepeer-review


We present a generalization of finite automata using Petri nets as control, called Concurrent Finite Automata for short. Several modes of acceptance, defined by final markings of the Petri net, are introduced, and their equivalence is shown. The class of languages obtained by *-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined by final marking, and is contained in the class of context-sensitive languages.
Original languageEnglish
Pages (from-to)111 - 121
Number of pages10
JournalFundamenta Informaticae
Issue number1-4
Publication statusPublished - 1 Jan 2008


  • theory of computation
  • automata
  • petri nets
  • concurrency


Dive into the research topics of 'Petri Net Controlled Finite Automata'. Together they form a unique fingerprint.

Cite this