A note on controllability of deterministic context-free~systems

DOI10.1016/J.AUTOMATICA.2012.06.004MaRDI QIDQ2391510zbMATH OpenOpenAlexFDO

Authors Tomáš Masopust

Publication date 31 July 2013

Published in Automatica (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0005109812002543

zbMATH Keywords

controllabilitydecidabilitydeterministic context-free systemsdiscrete-event systemsstate-space explosion problem

Mathematics Subject Classification ID

Controllability (93B05) Discrete event control/observation systems (93C65)

Recommendations

• A Note on Deciding Controllability in Pushdown Systems
• Controllability of predicates and languages in discrete-event systems
• On control of systems modelled as deterministic Rabin automata
• A note on deciding the controllability of a language K with respect to a language L
• Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively
• Computable semantics for \(\text{CTL}^*\) on discrete-time and continuous-space dynamic systems
• scientific article; zbMATH DE number 18045
• Controllability, reachability, and stabilizability of finite automata: a controllability matrix method
• A Note on the Properties of the Supremal Controllable Sublanguage in Pushdown Systems
• Computable CTL * for Discrete-Time and Continuous-Space Dynamic Systems

Cites work

• \(L(A)=L(B)\)? decidability results from complete formal systems
• A Note on Deciding Controllability in Pushdown Systems
• A variant of a recursively unsolvable problem
• scientific article; zbMATH DE number 3959244 (Why is no real title available?)
• scientific article; zbMATH DE number 1405670 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Introduction to Discrete Event Systems
• More concise representation of regular languages by automata and regular expressions
• On a weaker notion of controllability of a language K with respect to a language L

Cited in

(3)

• Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively
• On a weaker notion of controllability of a language K with respect to a language L
• A note on deciding the controllability of a language K with respect to a language L

Describes a project that uses

Uses Software

• UMDES

This page was built for publication: A note on controllability of deterministic context-free~systems

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