Abstract
A method is proposed for the development of complex finite state machines (FSMs) from their compositional specifications in the logical language L. A compositional specification of an FSM consists of specifications of its component modules and interconnections between them. The FSM synthesized is obtained by combining the state transition graphs of the modules synthesized from their specifications.
Similar content being viewed by others
References
D. Harel, “Statecharts: A visual formalism for complex systems,” Sci. Comput. Program., 8, No. 3, 231–274 (1987).
D. Harel and A. Naamad, “The STATEMATE semantics of statecharts,” ACM Trans. Software Eng., 5, No. 4, 293–333 (1996).
Yi-Sheng Huang, “Design of traffic light control systems using statecharts,” Computer J., 49, No. 6, 634–649 (2006).
R. Alur and T. Henzinger, “Reactive modules,” Formal Methods in System Design, 15, No. 1, 7–48 (1999).
R. Alur and R. Grosu, “Modular refinement of hierarchic reactive machines,” in: Proc. 27th Ann. ACM Symp. on Principles of Programming Languages, ACM Press, New York (2000), pp. 390–402.
A. Petrenko, S. Boroday, and R. Groz, “Confirming configurations in EFSM testing,” IEEE Trans. Software Eng., 30, No. 1, 29–42 (2004).
Y. Byun and B. A. Sanders, “A pattern-based development methodology for communication protocols,” J. Inform. Sci. and Eng., 22, 315–335 (2006).
A. Sowmya and S. Ramesh, “Extending statecharts with temporal logic,” IEEE Trans. Software Eng., 24, No. 3, 216–231 (1998).
L. Jemni and O. Mosbahi, “Combining STATEMATE and FNLOG for the specification and the upsilon erification of complex real time systems,” GESTS Intern. Trans. Comput. Sci. and Eng., 20, No. 1, 65–76 (2005).
D. Drusinsky, “Semantics and runtime monitoring of TL Charts: Statecharts atomata with temporal logic conditional transitions,” Electron. Notes Theoret. Comput. Sci., 113, No. 3, 3–21 (2005).
V. G. Timofeyev and A. N. Chebotarev, “Improved method of synthesis of an automaton from its specification in the language L,” Cybernetics and Systems Analysis, 47, No. 3, 335–345 (2011).
Y. Byun, B. A Sanders, and K. Chung, “A pattern language for communication protocols,” in: Proc. 9th Conf. Pattern Languages Programs (PLoP’02), Univ. of Illinois, Monticello (IL) (2002), pp. 1–32.
A. N. Chebotarev, “On an approach to functional specification of automata systems. I,” Cybernetics and Systems Analysis, 29, No. 3, 330–337 (1993).
A. N. Chebotarev, “On the class of L*-language formulas that specify finite-memory finite-state machines,” Cybernetics and Systems Analysis, 46, No. 1, 1–6 (2010).
A. N. Chebotarev, “A method of specification of reactive algorithms in a logical language of the first order,” Probl. Program., Nos. 1–2, 273–279 (2000).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 5, September–October, 2013, pp. 14–27.
Rights and permissions
About this article
Cite this article
Chebotarev, A.N. Compositional approach to the development of reactive algorithms. Cybern Syst Anal 49, 652–662 (2013). https://doi.org/10.1007/s10559-013-9552-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-013-9552-x