Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively

DOI10.1007/s10626-015-0221-2zbMath1332.93006OpenAlexW2184268474MaRDI QIDQ262426

Jörg Raisch, Anne-Kathrin Schmuck, Sven Schneider, Uwe Nestmann

Publication date: 29 March 2016

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-015-0221-2

zbMATH Keywords

deterministic context free languagesminimally restrictive supervisorpushdown automatasupervisory control theorysupremal controllable sublanguage

Mathematics Subject Classification ID

Controllability (93B05) Formal languages and automata (68Q45) Hierarchical systems (93A13)

Uses Software

• libFAUDES

Cites Work

• Asynchronous \(l\)-complete approximations
• Supervisory control of hybrid systems within a behavioural framework
• 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
• Verification and Control of Hybrid Systems
• A Note on the Properties of the Supremal Controllable Sublanguage in Pushdown Systems
• A Note on Deciding Controllability in Pushdown Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively