Abstract
We study a method for synthesizing control programs. The method merges an existing control program with a control automaton. We have used monadic second order logic over strings to specify the control automata. Specifications are translated into automata by the Mona tool. 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.
Basic Research in Computer Science, Center of the Danish National Research Foundation.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Claus Brabrand. Synthesizing safety controllers for interactive Web services. Master’s thesis, Department of Computer Science, University of Aarhus, December 1998. Available from http://www.brics.dk/~brabrand/thesis/.
J.R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math., 6:66–92, 1960.
E.W. Dijkstra. Solution of a problem in concurrent programming control. Communications of the ACM, 8(9):569, September 1965.
C.C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society, 98:21–52, 1961.
T. Hune. Modelling a real-time language. In Proceedings of Fourth International Workshop on Formal Methods for Industrial Critical Systems, 1999.
K. Jensen and G. Rozenberg, editors. High-level Petri Nets — Theory and Application. Springer-Verlag, 1991.
N. Klarlund and A. Møller. MONA Version 1.3 User Manual. BRICS Notes Series NS-98-3 (2.revision), Department of Computer Science, University of Aarhus, October 1998.
K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. In Springer International Journal of Software Tools for Technology Transfer, 1(1+2), 1997.
LEGO. Software developers kit, November 1998. See http://www.legomindstorms.com/.
Z. Manna and A. Pnueli. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68–93, January 1984.
S. Mauw and M. A. Reniers. An algebraic semantics of Basic Message Sequence Charts. The Computer Journal, 37(4):269–277, 1994.
Peter J. G. Ramadge and W. Murray Wonham. The control of discrete event systems. Proceedings of the IEEE, 77(1):81–98, January 1989.
Anders Sandholm and Michael I. Schwartzbach. Distributed safety controllers for Web services. In Egidio Astesiano, editor, Fundamental Approaches to Software Engineering, FASE’98, Lecture Notes in Computer Science, LNCS 1382, pages 270–284. Springer-Verlag, March/April 1998. Also available as BRICS Technical Report RS-97-47.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hune, T., Sandholm, A. (2000). A Case Study on Using Automata in Control Synthesis. In: Maibaum, T. (eds) Fundamental Approaches to Software Engineering. FASE 2000. Lecture Notes in Computer Science, vol 1783. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46428-X_24
Download citation
DOI: https://doi.org/10.1007/3-540-46428-X_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67261-6
Online ISBN: 978-3-540-46428-0
eBook Packages: Springer Book Archive