Supervisory control synthesis for deterministic context free specification languages

详细信息    查看全文

• 作者：Anne-Kathrin Schmuck ; Sven Schneider ; Jörg Raisch…
• 关键词：Supervisory control theory ; Supremal controllable sublanguage ; Minimally restrictive supervisor ; Deterministic context free languages ; Pushdown automata
• 刊名：Discrete Event Dynamic Systems
• 出版年：2016
• 出版时间：March 2016
• 年：2016
• 卷：26
• 期：1
• 页码：5-32
• 全文大小：2,352 KB
• 参考文献：Chen Y-L, Lin F (2000) Modeling of discrete event systems using finite state machines with parameters. In: Control Applications, 2000. Proceedings of the 2000 IEEE International Conference on, pp 941– 946
  Chen Y-L, Lin F (2001) Safety control of discrete event systems using finite state machines with parameters. In: American Control Conference, 2001. Proceedings of the 2001, vol 2, pp 975–980
  Griffin C (2006) A note on deciding controllability in pushdown systems. IEEE Trans Autom Control 51(2):334–337CrossRef MathSciNet
  Griffin C (2007) Decidability and optimality in pushdown control systems: A new approach to discrete event control. PhD thesis, The Pensylvania State University
  Griffin C (2008) A note on the properties of the supremal controllable sublanguage in pushdown systems. IEEE Trans Autom Control 53(3):826–829CrossRef MathSciNet
  Hopcroft JE, Ullman JD (1979) Introduction to Automata Theory, languages and computation. Addison-Wesley Publishing company
  libFAUDES (2013) Software library for discrete event systems
  Masopust T (2012) A note on controllability of deterministic context-free systems. Automatica 48(8):1934–1937CrossRef MathSciNet MATH
  Moor T, Raisch J (1999) Supervisory control of hybrid systems within a behavioural framework. Syst Control Lett 38:157–166CrossRef MathSciNet MATH
  Paulson L, Nipkow T, Wenzel M (2011) Isabelle/HOL
  Ramadge P, Wonham W (1984) Supervisory control of a class of discrete event processes. In: Bensoussan A, Lions J (eds) Analysis and Optimization of Systems, volume 63 of Lecture Notes in Control and Information Sciences. Springer Berlin Heidelberg, pp 475–498
  Schmuck A-K, Raisch J (2014) Asynchronous l-complete approximations. Syst Control Lett 73(0):67– 75CrossRef MathSciNet MATH
  Schmuck A-K, Schneider S, Raisch J, Nestmann U (2014) Extending supervisory controller synthesis to deterministic pushdown automata—enforcing controllability least restrictively. In: Proceedings of the 12th IFAC - IEEE International Workshop on Discrete Event Systems, pp 286–293
  Schneider S (2014) Behavioral optimizations for deterministic pushdown automata. In: (submitted for publication)
  Schneider S, Nestmann U (2014) Enforcing operational properties including blockfreeness for deterministic pushdown automata
  Schneider S, Schmuck A-K, Raisch J, Nestmann U (2014) Reducing an operational supervisory control problem by decomposition for deterministic pushdown automata. In: Proceedings of the 12th IFAC - IEEE International Workshop on Discrete Event Systems, pp 214–221
  Sreenivas RS (1993) On a weaker notion of controllability of a language k with respect to a language l. IEEE Trans Autom Control 38(9):1446–1447CrossRef MathSciNet MATH
  Tabuada P (2009) Verification and Control of Hybrid Systems - A Symbolic Approach, vol 1. Springer Science+Business Media
  Wonham WM, Ramadge PJ (1987) On the supremal controllable sublanguage of a given language, vol 25, pp 637–659
  
• 作者单位：Anne-Kathrin Schmuck (1)
  Sven Schneider (2)
  Jörg Raisch (2) (3)
  Uwe Nestmann (3)
  
  1. Max Planck Institute for Software Systems, Kaiserslautern, Germany
  2. Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg, Germany
  3. Technische Universität Berlin, Berlin, Germany
  
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Systems Theory and Control
  Operation Research and Decision Theory
  Convex and Discrete Geometry
  Electronic and Computer Engineering
  Manufacturing, Machines and Tools
  
• 出版者：Springer Netherlands
• ISSN：1573-7594

文摘

This paper describes two steps in the generalization of supervisory control theory to situations where the specification is modeled by a deterministic context free language (DCFL). First, it summarizes a conceptual iterative algorithm from Schneider et al. (2014) solving the supervisory control problem for language models. This algorithm involves two basic iterative functions. Second, the main part of this paper presents an implementable algorithm realizing one of these functions, namely the calculation of the largest controllable marked sublanguage of a given DCFL. This algorithm least restrictively removes controllability problems in a deterministic pushdown automaton realizing this DCFL.