Abstract

Given a model of an uncontrolled system and a requirement specification, a supervisory controller can be synthesized so that the system under control adheres to the requirements. There are several ways in which informal behavioral safety requirements can be formalized, one of which is using mutual state exclusion requirements. In current implementations of the supervisor synthesis algorithm, synthesis may be inefficient when mutual state exclusion requirements are used. We propose a method to efficiently enforce these requirements in supervisor synthesis. We consider symbolic supervisor synthesis, where Binary Decision Diagrams are used to represent the system. The efficiency of the proposed method is evaluated by means of an industrial and academic case study.

Highlights

  • A challenge in control software development is satisfying the ever-increasing demand for quality, performance, and safety

  • The requirement specification can be given by a mutual state exclusion requirement: not(LightA.Green and LightB.Green) As another option, the modeler may give two statetransition exclusion requirements, specifying that one light can only be turned green if the other light is red: green A needs LightB.Red green B needs LightA.Red Through general usage of CIF, it has been noticed empirically that the manner in which the requirements are modeled can impact the efficiency of performing supervisor synthesis, even if they represent the same informal requirement specification and the same controlled behavior is achieved

  • The use of mutual state exclusion requirements was found to have a negative impact on the computational effort to apply synthesis, and were omitted in some cases

Read more

Summary

INTRODUCTION

A challenge in control software development is satisfying the ever-increasing demand for quality, performance, and safety. The requirement specification can be given by a mutual state exclusion requirement: not(LightA.Green and LightB.Green) As another option, the modeler may give two statetransition exclusion requirements, specifying that one light can only be turned green if the other light is red: green A needs LightB.Red green B needs LightA.Red Through general usage of CIF, it has been noticed empirically that the manner in which the requirements are modeled can impact the efficiency of performing supervisor synthesis, even if they represent the same informal requirement specification and the same controlled behavior is achieved. The usage of mutual state exclusion requirements would lead to computations that required a lot of time and memory This type of requirement specification was sometimes avoided when modeling larger systems. None of these works investigate efficient enforcement of mutual state exclusion requirements

Automata
Requirements
Symbolic Supervisor Synthesis
CONVERSION OF MUTUAL STATE EXCLUSION REQUIREMENTS TO STATE-EDGE EXCLUSION
EXPERIMENTS
Measuring computational effort
Cat and Mouse Tower
CONCLUSIONS
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.