Using Automata in Control Synthesis. A Case Study

We study a method for synthesizing control programs. The method merges an existing control program with a control automaton. For specifying the control automata we have used monadic second order logic over strings. Using the Mona tool, specifications are translated into automata. This yields a new control program restricting the behavior of the old control program such that the specifications are satisfied. The method is presented through a concrete example.

[1]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[2]  C. C. Elgot.  Decision problems of finite automata design and related arithmetics , 1961 .

[3]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

[4]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.

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

[6]  Grzegorz Rozenberg,et al.  High-level Petri Nets: Theory And Application , 1991 .

[7]  Jana Kosecka,et al.  Control of Discrete Event Systems , 1992 .

[8]  Michel A. Reniers,et al.  An Algebraic Semantics of Basic Message Sequence Charts , 1994, Comput. J..

[9]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[10]  Anders Sandholm,et al.  Distributed Safety Controllers for Web Services , 1997, FASE.

[11]  Thomas Hune,et al.  Modelling a Real-Time Language , 1999 .

[12]  Ivan Damgård,et al.  Multiparty Computation from Threshold Homomorphic Encryption , 2000, EUROCRYPT.

[13]  Thomas Hune,et al.  Modeling a Language for Embedded Systems in Timed Automata , 2000 .

[14]  Glynn Winskel,et al.  Language, Semantics, and Methods for Cryptographic Protocols , 2000 .

[15]  Olivier Danvy,et al.  Syntactic accidents in program analysis: on the impact of the CPS transformation , 2000, ICFP '00.

[16]  Vinodchandran Variyam.  A Note on NP \ coNP=poly , 2000 .

[17]  Jirí Srba.  Complexity of Weak Bisimilarity and Regularity for BPA and BPP , 2000, EXPRESS.

[18]  Luca Aceto,et al.  2-Nested Simulation Is Not Finitely Equationally Axiomatizable , 2000, STACS.

[19]  Rajeev Alur,et al.  Heuristics for Hierarchical Partitioning with Application to Model Checking , 2000, CHARME.