Extensions of pushdown automata and Petri nets

Authors:
T. Y. Lin
Affiliations:
California State University, Northridge, California
Venue:
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Year:
1989

Citing 3
Cited 0

Petri Nets

ACM Computing Surveys (CSUR)
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new class of "concurrent automata" is constructed. These automata are extensions of pushdown automata and Petri nets. They lie properly between ordinary Petri nets and Turing machines. In the September 1977 issue of Computing survey James Peterson states that "Any significant extension of the Petri net model tends to be equivalent to a Turing machine". This paper settled his conjecture negatively. The formal languages that are accepted/reconized by this automata lie properly between context free languages and context sensitive languages.