Deterministic weak-and-marked Petri net languages are regular

Stéphane Gaubert, Alessandro GiuaIEEE Trans. Automatic Control 1996 · OpenReview

Abstract

The intersection of the class of deterministic weak and the class of deterministic marked Petri net languages is the class of regular languages. We prove this result using a lemma that characterizes regular deterministic Petri net languages.
BibTeX
@article{gaubert1996deterministic,
  author = {Stéphane Gaubert and Alessandro Giua},
  title = {{Deterministic weak-and-marked Petri net languages are regular}},
  journal = {IEEE Trans. Automatic Control},
  year = {1996},
  url = {https://openreview.net/forum?id=PG8NX33z3j},
}

Loading related content...

Figure