Petri Net Controlled Finite Automata

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

Petri Net Controlled Finite Automata

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

Cyfadran Cyfrifiadureg, Peirianneg a Gwyddoniaeth

Allbwn ymchwil: Cyfraniad at gyfnodolyn › Erthygl › adolygiad gan gymheiriaid

Crynodeb

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.

Iaith wreiddiol	Saesneg
Tudalennau (o-i)	111 - 121
Nifer y tudalennau	10
Cyfnodolyn	Fundamenta Informaticae
Cyfrol	85
Rhif cyhoeddi	1-4
Statws	Cyhoeddwyd - 1 Ion 2008

Mynediad at Ddogfen

https://content.iospress.com/articles/fundamenta-informaticae/fi85-1-4-09?resultNumber=0&totalResults=79&start=0&q=Petri+Net+Controlled+Finite+Automata&resultsPageSize=10&rows=10

Dyfynnu hyn

@article{be38fa499a0242b9b98a906a38a3c628,

title = "Petri Net Controlled Finite Automata",

abstract = "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.",

keywords = "theory of computation, automata, petri nets, concurrency",

author = "Berndt Muller and M. Jantzen and M. Kudlek and H. R{\"o}lke and G. Zetzsche",

year = "2008",

month = jan,

day = "1",

language = "English",

volume = "85",

pages = "111 -- 121",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press",

number = "1-4",

}

TY - JOUR

T1 - Petri Net Controlled Finite Automata

AU - Muller, Berndt

AU - Jantzen, M.

AU - Kudlek, M.

AU - Rölke, H.

AU - Zetzsche, G.

PY - 2008/1/1

Y1 - 2008/1/1

N2 - 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.

AB - 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.

KW - theory of computation

KW - automata

KW - petri nets

KW - concurrency

M3 - Article

SN - 0169-2968

VL - 85

SP - 111

EP - 121

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

IS - 1-4

ER -

Petri Net Controlled Finite Automata

Crynodeb

Mynediad at Ddogfen

Ôl bys

Dyfynnu hyn