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

Authors:
Mojmir Kretinsky;Vojtech Rehak;Jan Strejcek
Affiliations:
Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno, Czech Republic;Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno, Czech Republic;Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno, Czech Republic
Venue:
Theoretical Computer Science
Year:
2008

Citing 8
Cited 0

On the regular structure of prefix rewriting

CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Process rewrite systems

Information and Computation - Special issue on EXPRESS 1997
Pushdown automata, multiset automata, and Petri nets

Theoretical Computer Science
Deciding bisimulation-like equivalences with finite-state processes

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
Grammars as Processes

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Infinite Results

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit.