Deterministic weak-and-marked Petri net languages are regular

DOI10.1109/9.545718zbMath0867.93009OpenAlexW2149002245MaRDI QIDQ3124464

Stéphane Gaubert, Alessandro Giua

Publication date: 16 July 1997

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/00f03331f74504924fef404f884d116a1cff892b

zbMATH Keywords

controllabilitydiscrete-event systemsregular languagessupervisory control theorydeterministic marked Petri net languagesdeterministic weak Petri net languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Hierarchical systems (93A13) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Petri net languages and infinite subsets of \(\mathbb{N}^m\) ⋮ Unnamed Item

This page was built for publication: Deterministic weak-and-marked Petri net languages are regular