A note on deciding the controllability of a language K with respect to a language L

DOI10.1109/9.250543MaRDI QIDQ5288788zbMATH OpenOpenAlexFDO

Authors R. Sreenivas

Publication date 22 August 1993

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

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

zbMATH Keywords

decidabilitycontrollability of a languagePetri net reachability problemplant automaton

Mathematics Subject Classification ID

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

Recommendations

• On a weaker notion of controllability of a language K with respect to a language L
• Decidability and closure properties of weak Petri net languages in supervisory control
• A note on controllability of deterministic context-free~systems
• Blocking and controllability of Petri nets in supervisory control

Cited in

(3)

• Petri net languages and infinite subsets of \(\mathbb{N}^m\)
• A note on controllability of deterministic context-free~systems
• On a weaker notion of controllability of a language K with respect to a language L

This page was built for publication: A note on deciding the controllability of a language K with respect to a language L

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5288788)