In this paper, we consider various classes of (infinite-state) automata generated by simple rewrite transition systems. These classes are defined by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel composition. In this way, we provide natural definitions for commutative (parallel) context-free automata, multiset (parallel, or random access, pushdown) automata, and Petri nets. We provide example automata which demonstrate the strictness of this hierarchy. In particular, we provide a proof of an earlier conjecture by Moller: that multiset automata form a proper subset of Petri nets. This result contrasts with the result of Caucal for the analogous question in the sequential case where the hierarchy collapses.
- Petri nets
- Rewrite systems