Pushdown automata, multiset automata, and Petri nets

Authors:
Yoram Hirshfeld;Faron Moller
Affiliations:
School of Mathematical Sciences, Tel Aviv University, Israel;Computing Science Department, Uppsala University, Uppsala, Sweden
Venue:
Theoretical Computer Science
Year:
2001

Citing 0
Cited 5

Note: Petri nets are less expressive than state-extended PA

Theoretical Computer Science
Reachability is decidable for weakly extended process rewrite systems

Information and Computation
Reachability of hennessy-milner properties for weakly extended PRS

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Reaction automata

Theoretical Computer Science
On the properties of language classes defined by bounded reaction automata

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract