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

DOI10.1109/9.384227zbMath0824.93008OpenAlexW2055511472MaRDI 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 netssupremal controllable sublanguagesupervisorsterminal behaviorsweak languages

Mathematics Subject Classification ID

Controllability (93B05) Hierarchical systems (93A13) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General systems (93A10)

Related Items (5)

Supervision based on place invariants: a survey ⋮ Petri net languages and infinite subsets of \(\mathbb{N}^m\) ⋮ Supervisory control of discrete event systems with flexible marking ⋮ Supervisory Control of Petri Nets with Language Specifications ⋮ Unnamed Item

This page was built for publication: Decidability and closure properties of weak Petri net languages in supervisory control