Decidability and closure properties of weak Petri net languages in supervisory control

DOI10.1109/9.384227zbMath0824.93008MaRDI QIDQ4841496

Alessandro Giua, Frank DiCesare

Publication date: 9 November 1995

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

Full work available at URL: https://doi.org/10.1109/9.384227

zbMATH Keywords

Petri nets; supremal controllable sublanguage; supervisors; terminal behaviors; weak languages

Mathematics Subject Classification ID

93B05: Controllability

93A13: Hierarchical systems

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

93A10: General systems

Related Items

Supervision based on place invariants: a survey, Petri net languages and infinite subsets of \(\mathbb{N}^m\)