Skip to main content
SpringerLink
Log in

Semantic Translation of Simulink Diagrams to Input/Output Extended Finite Automata

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

We develop a semantic translation approach for Simulink diagrams. Simulink is a graphical tool for representing and simulating dynamical systems. We propose a recursive approach for translating a class of Simulink diagrams to input/output-extended finite automata (I/O-EFA). An I/O-EFA model of a Simulink diagram can be used for further analysis such as test generation and formal verification. We show that the translation approach is sound and complete: The input-state-output behavior of an I/O-EFA model, as defined in terms of a step-trajectory, preserves the input-state-output behavior of the corresponding Simulink diagram at each sample time (assuming the same integration method for any of the continuous blocks with dynamics).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  • Agrawal A, Simon G, Karsai G (2004) Semantic translation of Simulink/stateflow models to hybrid automata using graph transformations. ENTCS 109:43–56

    Google Scholar 

  • Alur R, Kanade A, Ramesh S, Shashidhar KC (2008) Symbolic analysis for improving simulation coverage of Simulink/stateflow models. In: EMSOFT ’08: proceedings of the 7th ACM international conference on embedded software. ACM, New York, pp 89–98

    Chapter  Google Scholar 

  • Caspi P, Curic A, Maignan A, Sofronis C, Tripakis S, Niebert P (2003) From Simulink to scade/lustre to tta: a layered approach for distributed embedded applications. SIGPLAN Not. 38(7):153–162

    Article  Google Scholar 

  • Gadkari A, Mohalik S, Shashidhar KC, Suresh J, Yeolekar A, Ramesh S (2007) Automatic generation of test cases using model checking for sl/sf models. In: 4th international workshop on model-driven engineering, verification, and validation. Nashville, Tennessee

  • Jersak M, Ziegenbein D, Wolf F, Richter K, Ernst R, Cieslog F, Teich J, Strehl K, Thiele L (2000) Embedded system design using the spi workbench. In: Proc. of the 3rd international forum on design languages

  • Kumar R, Zhou C, Basu S (2006) Finite bisimulation of reactive untimed infinite state systems modeled as automata with variables. In: Proceedings of the 25th American control conference. Minneapolis, pp 6057–6062

  • Lee D, Yannakakis M (1996) Principles and methods of testing finite state machines—a survey. Proc IEEE 84(8):1090–1123

    Article  Google Scholar 

  • Lublinerman R, Szegedy C, Tripakis S (2009) Modular code generation from synchronous block diagrams—modularity vs. code size. In: POPL’09

  • Lublinerman R, Tripakis S (2008a) Modular code generation from triggered and timed block diagrams. In: Real-time and embedded technology and applications symposium (RTAS’08)

  • Lublinerman R, Tripakis S (2008b) Modularity vs. reusability: code generation from synchronous block diagrams. In: Design, automation and test in Europe (DATE’08)

  • Sal homepage (2010) http://sal.csl.sri.com/. Accessed 24 Aug 2010

  • Scaife N, Sofronis C, Caspi P, Tripakis S, Maraninchi F (2004) Defining and translating a “safe” subset of Simulink/stateflow into lustre. In: Proc. EMSOFT’04

  • Simulink (2010) http://www.mathworks.com/products/simulink/

  • Takenaka T, Okano K, Higashino T, Taniguchi K (2006) Symbolic model checking of extended finite state machines with linear constraints over integer variables. Syst Comput Jpn 37(6):64–72

    Article  Google Scholar 

  • Tripakis S, Sofronis C, Caspi P, Curic A (2005) Translating discrete-time Simulink to lustre. ACM Trans Embed Comput Syst 4(4):779–818

    Article  Google Scholar 

  • Zhou C, Kumar R (2009) On identification of input/output extened automata with finite bisimilar quotients. In: 2009 American Control Conference. St. Louis, MO

Download references

Author information

Authors and Affiliations

  1. Magnatech LLC, East Granby, CT, 06026, USA

    Changyan Zhou

  2. Iowa State Univ., Ames, IA, 50011, USA

    Ratnesh Kumar

Authors
  1. Changyan Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ratnesh Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Changyan Zhou.

Additional information

This work was supported in part by the National Science Foundation under the grants NSF-ECS-0424048, NSF-ECS-0601570, NSF-ECCS-0801763, NSF-CCF-0811541, and NSF-ECCS-0926029.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, C., Kumar, R. Semantic Translation of Simulink Diagrams to Input/Output Extended Finite Automata. Discrete Event Dyn Syst 22, 223–247 (2012). https://doi.org/10.1007/s10626-010-0096-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10626-010-0096-1

Keywords

Search

Navigation