DCSynth: Guided Reactive Synthesis with Soft Requirements

In reactive controller synthesis, a number of implementations (controllers) are possible for a given specification because of the incomplete nature of specification. To choose the most desirable one from the various options, we need to specify additional properties which can guide the synthesis. In this paper, We propose a technique for guided controller synthesis from regular requirements which are specified using an interval temporal logic QDDC. We find that QDDC is well suited for guided synthesis due to its superiority in dealing with both qualitative and quantitative specifications. Our framework allows specification consisting of both hard and soft requirements as QDDC formulas. We have also developed a method and a tool DCSynth, which computes a controller that invariantly satisfies the hard requirement and it optimally meets the soft requirement. The proposed technique is also useful in dealing with conflicting i.e., unrealizable requirements, by making some of them as soft requirements. Case studies are carried out to demonstrate the effectiveness of the soft requirement guided synthesis in obtaining high-quality controllers. The quality of the synthesized controllers is compared using metrics measuring both the guaranteed and the expected case behaviour of the controlled system. Tool DCSynth facilitates such comparison.

[1]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[2]  Nils Klarlund,et al.  MONA Implementation Secrets , 2000, Int. J. Found. Comput. Sci..

[3]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[4]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[5]  Paritosh K. Pandya,et al.  Finding Extremal Models of Discrete Duration Calculus formulae using Symbolic Search , 2005, AVoCS.

[6]  Krishnendu Chatterjee,et al.  Better Quality in Synthesis through Quantitative Objectives , 2009, CAV.

[7]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[8]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[9]  Paritosh K. Pandya,et al.  Digitizing Interval Duration Logic , 2003, CAV.

[10]  Paritosh K. Pandya.  Model Checking CTL*[DC] , 2001, TACAS.

[11]  Ufuk Topcu,et al.  Receding Horizon Temporal Logic Planning , 2012, IEEE Transactions on Automatic Control.

[12]  Stéphane Lafortune,et al.  Supervisory control and reactive synthesis: a comparative introduction , 2017, Discret. Event Dyn. Syst..

[13]  Zhou Chaochen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems , 2004 .

[14]  Supratik Chakraborty,et al.  Bounded Validity Checking of Interval Duration Logic , 2005, TACAS.

[15]  Stéphane Lafortune,et al.  Thirty Years of the Ramadge-Wonham Theory of Supervisory Control: A Retrospective and Future Perspectives [Conference Reports] , 2018, IEEE Control Systems.

[16]  Calin Belta,et al.  LTL receding horizon control for finite deterministic systems , 2014, Autom..

[17]  Sanjit A. Seshia,et al.  Reactive synthesis from signal temporal logic specifications , 2015, HSCC.

[18]  Paritosh K. Pandya,et al.  Specification and Reactive Synthesis of Robust Controllers , 2019, ArXiv.

[19]  Joost-Pieter Katoen,et al.  The Ins and Outs of the Probabilistic Model Checker MRMC , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[20]  Bernd Finkbeiner,et al.  BoSy: An Experimentation Framework for Bounded Synthesis , 2017, CAV.

[21]  Thomas A. Henzinger,et al.  Synthesizing robust systems , 2009, FMCAD.

[22]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[23]  M. Raj Mohan,et al.  Formalizing Timing Diagram Requirements in Discrete Duration Calculus , 2017, SEFM.

[24]  Véronique Bruyère,et al.  Acacia+, a Tool for LTL Synthesis , 2012, CAV.

[25]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

[26]  P. Pandya.  Specifying and Deciding Quantified Discrete-time Duration Calculus Formulae using DCVALID , 2000 .

[27]  Kim G. Larsen,et al.  Average-energy games , 2015, Acta Informatica.

[28]  Bernd Finkbeiner,et al.  The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results , 2019, ArXiv.

[29]  M. Raj Mohan,et al.  DCSYNTH: Guided Reactive Synthesis with Soft Requirements for Robust Controller and Shield Synthesis , 2017, ArXiv.

[30]  Michael Huth,et al.  Message from the program chairs , 2011, Perform. Evaluation.

[31]  Sophie Pinchinat,et al.  Quantified Mu-Calculus for Control Synthesis , 2003, MFCS.

[32]  Shankara Narayanan Krishna,et al.  Modal Strength Reduction in Quantified Discrete Duration Calculus , 2005, FSTTCS.

[33]  Paritosh K. Pandya,et al.  The Saga of Synchronous Bus Arbiter: On Model Checking Quantitative Timing Properties of Synchronous Programs , 2002, SLAP@ETAPS.

[34]  M. Raj Mohan,et al.  DCSYNTH: A Tool for Guided Reactive Synthesis with Soft Requirements , 2019, ArXiv.