# Patent

## Title
Semantic translation of time-driven simulink diagrams using input/output extended finite automata

## Abstract

A method of semantic translation of a class of diagrams to input/output-extended finite automata is provided. The method includes receiving a data representation of a diagram, said diagram comprising a plurality of blocks and said diagram being associated with a graphical modeling environment which defines semantics for executing the diagram, and processing, using a computing device, the data representation of the diagram to translate the diagram to an input/output-extended finite automata model.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims priority under 35 U.S.C. §119 of a provisional application Ser. No. 61/357,568 filed Jun. 23, 2010, and which application is hereby incorporated by reference in its entirety.


GRANT REFERENCE
This invention was made with government support under Grant No. NSF-CCF-0811541 awarded by the National Science Foundation. The government has certain rights in the invention.


FIELD OF THE INVENTION
The present invention relates to a semantic translation approach for diagrams associated with graphical modeling and simulation environments or tools. The semantic translation generates a model which may be used for further analysis such as test generation and formal verification.
BACKGROUND OF THE INVENTION
Graphical modeling and simulation environments or tools allow users to construct and analyze models of processes or systems using diagrams. There are various examples of such tools commercially available. One such example is Simulink from The MathWorks, Inc. A further example of a graphical modeling and simulation environments is Lab VIEW, available from National Instruments Corporation.
Typically, these diagrams describe computations or logic which can ultimately be implemented using application specific devices, computers, microcontrollers, FPGA, integrated circuits, or computing devices. The diagrams are built using elements or blocks which are interconnected. The diagrams are created within a graphical modeling environment which defines the semantics for executing the diagrams. Software systems or descriptions of hardware systems may then be produced which exhibit the behavior of the model or portions thereof.
The Simulink diagrams can be simulated to generate sample-runs (runs on sample times) which provide a means for their validation. Other means of validation include testing and verification. In order to be able to test a Simulink diagram or verify an implementation of a Simulink diagram, it is desirable to translate such diagrams into a form amenable to automated test generation or verification. Thus the corresponding techniques and tools for such translation are needed.
BRIEF SUMMARY OF THE INVENTION
Therefore, it is a primary object, feature, or advantage of the present invention to improve over the state of the art.
It is a further object, feature, or advantage of the present invention to a semantic translation approach which is recursive.
It is a still further object, feature, or advantage of the present invention to provide a semantic translation approach which is amenable to automated test generation and verification.
It is a still further object, feature, or advantage of the present invention to provide a semantic translation approach which has no special restriction on the types of blocks.
It is a still further object, feature, or advantage of the present invention to provide a semantic translation approach which is sound and complete.
According to one aspect of the present invention, a method of semantic translation of a diagram associated with a graphical modeling environment into an input/output-extended finite automata (I/O-EFA) model is provided. The method includes receiving a representation of the diagram and processing the representation of the diagram with a computing device by (a) representing all atomic blocks in said diagram as a tuple, (b) representing the diagram using a connecting rule and a conditioning rule, (c) determining an order in which the blocks included inside the diagram are executed, (d) translating the atomic blocks into the I/O-EFA model using a first algorithm, and (e) translating for the connecting rule and the condition rule using a second algorithm and a third algorithm, respectively to thereby modify the I/O-EFA model.
According to another aspect of the present invention, a computer-readable storage medium storing computer-executable instructions that are executed on a processing device is provided. The computer-executable instructions include instructions for receiving a data representation of a diagram, said diagram comprising a plurality of blocks and said diagram being associated with a graphical modeling environment which defines semantics for executing the diagram, and instructions for processing the data representation of the diagram to translate the diagram into an input/output-extended finite automata model.
According to another aspect of the present invention, a method of semantic translation of a diagram into input/output-extended finite automata (I/O-EFA) model is provided. The method includes: representing atomic blocks in the diagram as a tuple; representing the diagram using a connecting-rule and a conditioning-rule; determining an order in which the atomic blocks of the diagram are executed; translating the atomic-blocks into an I/O-EFA model; and translating for the connecting-rule and the conditioning-rule to adjust the I/O-EFA model. The steps may be performed by a computing device.
According to another aspect of the present invention, a method of translating a class of diagrams as input/output-extended finite automata is provided. The method includes receiving a data representation of a diagram, said diagram including a plurality of blocks and said diagram being associated with a graphical modeling environment which defines semantics for executing the diagram. The method further includes processing, using a computing device, the data representation of the diagram to translate the diagram into an input/output-extended finite automata model.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a simulink diagram of a counter.
FIG. 2 is a multirate simulink diagram.
FIG. 3 is a simulink diagram of bouncing ball.
FIG. 4 is I/O-EFA model of atomic-block ψ.
FIG. 5 is I/O-EFA model of system-block ψ=Ψ/C.
FIG. 6 is I/O-EFA model of Ψ2/C2 of Example 2.
FIG. 7 is I/O-EFA model of multirate Simulink diagram of Example 3.
FIG. 8 is I/O-EFA model of system-block ψ=ψθ.
FIG. 9 is I/O-EFA model of Ψ1 of Example 2.
FIG. 10 is I/O-EFA model of counter of Example 2.
FIG. 11 is I/O-EFA model of bouncing ball of Example 4.
FIG. 12 is Simulation of counter of Example 2 and its I/O-EFA model in FIG. 10.
FIG. 13 is Simulation of multirate Simulink diagram Example 3 and I/O-EFA model in FIG. 7.
FIG. 14 is Simulation of bouncing ball of Example 4 and its I/O-EFA model in FIG. 11.



DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
1. Introduction
Although the present invention may be used with diagrams from any number of graphical environments, Simulink/Stateflow (S/S) diagrams are used as representative examples of such diagrams. Simulink/Stateflow (S/S) [2] diagrams are graphical representations of dynamical systems, and can capture both time-driven as well as event-driven dynamics of hybrid systems. Stateflow diagrams are used for representing and simulating event-driven dynamics. The S/S diagrams can be simulated to generate sample-runs (runs on sample times) which provide a means for their validation. Other means of validation include testing and verification. In order to be able to test a S/S diagram or verify an implementation of a S/S diagram, a model-based approach is desirable, where a model can be used for automated test generation or as a formal specification.
Simulink blocks can be time-driven or non time-driven. A time-driven block, such as an Integrator block, represents the time-dependent mathematical relationships between its inputs and outputs. On the other hand, non time-driven block, such as a Stateflow block or a Discrete Event Subsystem block, may evolve upon the occurrence of events. Here, we focus on study the semantic translation of time-driven blocks, and for conciseness, we write “Simulink blocks” to mean only the “time-driven Simulink blocks”.
We propose an approach for translating the behaviors of a Simulink diagram at (discrete) sample times to input/output-extended finite automata (I/O-EFA) [9, 15]. Note that a Simulink diagram can represent a hybrid system that combines event-driven discrete and time-dependent continuous behaviors, whereas I/O-EFA is a model of a reactive untimed infinite state system. Yet, since we are only interested in capturing the behaviors of a Simulink diagram at sample times, an I/O-EFA model (which is untimed) suffices.
Simulink provides a library of blocks (such as transfer functions, discontinuities, math operations, logic and bit operations etc.), which can be interconnected in a hierarchical fashion to form an overall Simulink diagram. We consider the blocks in the Simulink library to be “atomic”, and formally define an atomic-block. Further we formulate two rules, namely connecting-rule and conditioning-rule, used in Simulink for building complex blocks by combining the simpler ones, and formally define a class of Simulink diagrams formed using these rules. This recursive view of defining the class of all Simulink diagrams leads to a recursive translation in form of I/O-EFA.
In order to obtain an I/O-EFA model recursively, we first present an algorithm for translating an atomic-block to an I/O-EFA. Next for each rule of combining simpler Simulink diagrams to construct a complex Simulink diagram, we develop a corresponding rule for combining the I/O-EFA models of simpler Simulink diagrams to build the I/O-EFA model of the more complex Simulink diagram.
We introduce the concept of a step of an I/O-EFA to emulate the computation of a Simulink diagram at a sample time. A sequence of steps, namely, a step-trajectory, generates outputs over a sequence of sample times. We show that the translation approach is sound and complete: The input-state-output behavior of the I/O-EFA, 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).
Various aspects of the present invention include:

    
    
        The translation approach is recursive. Formal definitions of an atomic Simulink block and a class of Simulink diagrams formed using the identified connecting-rule and conditioning-rule are provided. These definitions can be used to create a more complex Simulink diagram from the simpler ones.
        The model of I/O-EFA is amenable to automated test generation [10] or verification [14]. The model can be directly supplied to a test generation or verification tool that accepts I/O-EFA models or programming languages such as C/C++ or Java since an I/O-EFA model can be easily translated into these languages.
        The translation approach has no special restriction on the types of Simulink blocks. The approach supports virtually all blocks in Simulink Library (in this patent we only consider time-driven blocks) provided that the block can be mathematically written as input-state-output functions over time. Also unlike [4], it does not require a clear separation between discrete and continuous dynamics for modeling hybrid systems. As an illustration, consider for example the bouncing ball example presented herein.
        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).
        The translation approach can handle the Simulink features such as multi-rate diagrams, sample times with initial offsets, variable-step simulation etc.
        The translation approach is general in that it can be applied to other graphical modeling and simulation tools such as LabView.
    
    


2. I/O-EFA
We present the notion of an input-output extended finite automaton (I/O-EFA) as a formal model of representation for a Simulink diagram. I/O-EFA is a model of a reactive untimed infinite state system in form of an automaton, extended with discrete variables such as inputs, outputs, and data. Using I/O-EFA as a model, many value-passing processes can be represented as finite graphs. An I/O-EFA consists of locations (i.e., symbolic-state), data (i.e., numeric-state), numeric-inputs, numeric-outputs, symbolic-inputs, symbolic-outputs, transitions, an initial location, initial data values, and a final location. The locations (symbolic-states) together with the data (numeric-states) form the state-space of a I/O-EFA. The locations are finite and form the vertices of the automaton graph. The edges of the graph represent transitions between the locations and are guarded by constraints over the data and the inputs. The occurrence of a transition triggers a data update and an output assignment.
Definition 1 An input/output extended finite automaton (I/O-EFA) is a tuple

P=(L,D,U,Y,Σ,Δ,l0,D0,lm,E)

where

    
    
        L is the set of locations (symbolic-states),
        D=D1× . . . ×Dn is the set of typed data (numeric-states),
        U=U1× . . . ×Um is the set of typed numeric-inputs,
        Y=Y1× . . . ×Yp is the set of typed numeric-outputs,
        Σ is the set of symbolic-inputs,
        Δ is the set of symbolic-outputs,
        l0εL is the initial location,
        D0⊂D is the set of initial-data values,
        lmεL is the final location, and
        E is the set of edges, and each eεE is a 7-tuple,
        
            e=(oe, te, σe, δe, Ge, fe, he), where
            
                oeεL is the origin location,
                teεL is the terminal location,
                σeεΣ∪{ε} is the symbolic-input,
                δeεΔ∪{ε} is the symbolic-output,
                Ge⊂D×U is the enabling guard (a predicate),
                fe: D×U→D is the data-update function,
                he: D×U→Y is the output-assignment function.
            
            
        
        
    
    


Initially, P starts from the initial location l0 and an initial data value doεD0. While at a certain state (l,d)εL×D, a transition eεE such that oe=l is enabled if the input σe arrives, and the data d and input u are such that the guard Ge(d,u) holds. Note when σe=ε, the transition is enabled when only the guard Ge(d,u) holds; on the other hand when Ge(D,U)=True, then the transition is enabled when only σe arrives. An enabled transition can be executed. The execution of an enabled transition e at the state (oe,d) causes P to transit to the location te, the data value is updated to ƒe(d,u), the output variable is assigned the value he(d,u), and a discrete output δe is emitted.
3. Atomic-Blocks: Minimal Simulink Diagrams
Simulink provides a library of blocks, which can be used as minimal systems, and the corresponding Simulink diagrams will then be minimal Simulink diagrams. We refer to such blocks as atomic blocks. The atomic-blocks can be composed in a recursive fashion to construct more complex Simulink diagrams, and we discuss the rules of composition in the next section.
An atomic-block can be stateful or stateless. A stateful block's output depends on the history of its inputs. An example of a stateful block is the Unit Delay block. On the other hand, the output of a stateless block depends only on its current inputs. An example of a stateless block is the Gain block, which simply outputs its input signal, multiplied with a constant called the gain.
An atomic-block can be classified as continuous-time versus discrete-time, and is associated with a sample-period. For a continuous-time block, sample-period is the time between the instants when it is numerically simulated. For a discrete-time block, sample-period is the time between the instants when the corresponding discrete-time system evolves.
An atomic-block can be defined as follows.
Definition 2 An atomic Simulink block ψ can be represented as a tuple

(Uψ,Yψ,Dψ,D0ψ,{(Giψ,ƒiψ,hiψ)}i=1qψ,(Tψ,Toψ)),

where

    
    
        Uψ=U1ψ× . . . ×Umψψ is the set of typed inputs,
        Yψ=Y1ψ× . . . ×Ypψψ is the set of typed outputs,
        Dψ=D1ψ× . . . ×Dnψψ is the set of typed data,
        D0ψ⊂Dψ is the set of initial data conditions,
        {(Giψ, ƒiψ, hiψ)}i=1qψ is a set of triples, where
        
            Giψ⊂Dψ×Uψ is a predicate representing an enabling guard, such that vi=1qψ Gi=True,
            ƒiψ: Dψ×Uψ→Dψ is a data-update function,
            hiψ: Dψ×Uψ→Yψ is an output-assignment function.
        
        
        Tψ is the sample period and T0ψ is an offset (it is assumed zero by default if unspecified).

Remark 1 The kth sampling time occurs at kTψ+Toψ. The value of the input signal at the kth sampling time is denoted as u(k)=(u1(k), . . . , umψ(k))εUψ, and similarly for other signals. At the kth sampling time, if the data d(k) and the input u(k)) are such that Giψ(d(k),u(k)) holds, the next data, d(k+1)=ƒiψ(d(k),u(k)), is computed, and the output value is assigned to y(k)=hiψ(d(k),u(k)). Note that for continuous-time blocks, the data-update and output-assignment functions correspond to the ones obtained through discretization at sample times using an appropriate integration method. Simulink allows different kinds of sample period that include Discrete, Continuous, Inherited (−1), Constant (inf) and Triggered etc. Discrete sample periods are the only kind for which the evolution times of the corresponding system are known a priori. For blocks with other kinds of sample period, Simulink determines the evolution times of the corresponding system from the block's type or by its context within the model during the compilation phase of simulation. Given a Simulink diagram, the sample period of a non continuous-time block can be obtained from the get_param (object, ‘CompiledSampleTime’) command after compiling the diagram. The sample-period of a continuous-time block, which is used in discretization, can be chosen to be the greatest common divisor of all non continuous-time blocks using the following rule [3]: for 1≦i, j≦n,

    
    






  
    T
    ψ
  
  =
  
    {
    
      
        
          
            
              gcd
              ⁡
              
                (
                
                  {
                  
                    T
                    
                      ψ
                      i
                    
                  
                  }
                
                )
              
            
          
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                
                  T
                  o
                  
                    ψ
                    i
                  
                
              
              =
              
                T
                o
                
                  ψ
                  j
                
              
            
          
        
        
          
            
              gcd
              ⁡
              
                (
                
                  {
                  
                    
                      T
                      
                        ψ
                        i
                      
                    
                    ,
                    
                      T
                      o
                      
                        ψ
                        i
                      
                    
                  
                  }
                
                )
              
            
          
          
            otherwise
          
        
      
      ,
      
        

      
      ⁢
      
        
          and
          ⁢
          
            
          
          ⁢
          
            T
            o
            ψ
          
        
        =
        
          {
          
            
              
                
                  T
                  o
                  
                    ψ
                    i
                  
                
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      T
                      o
                      
                        ψ
                        i
                      
                    
                  
                  =
                  
                    T
                    o
                    
                      ψ
                      j
                    
                  
                
              
            
            
              
                0
              
              
                
                  otherwise
                  .
                
              
            
          
        
      
    
  




Also note for a stateless atomic-block ψ, the set Dψ is empty (and accordingly, there are no initial data conditions or data-update functions).

The following example illustrates the Definition 2.
Example 1
The Integrator block provides a continuous-time integration of the input signal. It models the relations, {dot over (d)}(t)=u(t) with d(0)=d0, and y(t)=d(t), where u is its input, d is its data, y is its output, t is the continuous-time variable, and d0 is the initial data condition. Using Euler's Method the discretization is d(k+1)=d(k)+Tψu(k). Thus, the Integrator block can be represented as:

(u,y,d,d0,{(−,d(k+1)=d(k)+Tψu(k),y(k)=d(k))},(Tψ,T0ψ)),

where Tψ is the sample-period and T0ψ is an offset.

Note that the Integrator block can be configured further by setting certain parameters to have a more complex behavior. An example is the Integrator block ψ5 in FIG. 3. In Example 1 we did not include this much detail for the sake of simplicity of illustration.
We introduce the following concepts for the computation of an atomic block over sample times.
Definition 3 Given an atomic-block ψ and an input uεUψ, we call the computation of the corresponding output yεYψ a step of ψ over u. y is called the output of a step of ψ over u. Given an input sequence {u(k)}k=0K, a step-trajectory of ψ over {u(k)}k=0K is a sequence of steps of ψ, where the kth step (0≦k≦K) in the sequence is over the input u(k). Letting y(k) (0≦k≦K) denote the output of ψ over u(k), {y(k)}k=0K is called the output of step-trajectory of ψ over {uk}k=0K.
4. System-Blocks: Simulink Diagrams
A Simulink diagram, also called a system-block, can be constructed by recursively composing atomic-blocks and other simpler system-blocks according to certain rules. The following two rules are the among the rules that Simulink uses for the construction of complex Simulink diagrams from the simpler ones:

    
    
        Connecting-rule: A certain input of one system-block can be connected to a certain output of another system-block. The connections over a set of system-blocks Ψ can be represented using a relation C⊂(Ψ×N)2, where N denotes the set of port numbers. A connection c=((ψ1,i),(ψ2,j))εC connects the output port i of system-block ψ1 to an input port j of system-block ψ2. The “C-connected Ψ system” thus formed is denoted Ψ/C. Note a possible choice for connections is the “null-connection”, and {ψ}/∅=ψ.
        Conditioning-rule: A system-block can be made conditionally executable when a certain guard condition over certain variables, called control-inputs, holds. Further the data may be reset when the guard condition holds, and the output may be reset when the guard condition is violated. Given a system-block ψ, a conditioning over ψ is a 5-tuple

θ:=(Uθ,Gθ,ƒθ,hθ,(Tθ,Toθ)),

where

        Uθ=U1θ× . . . ×Umθθ is the set of conditioning-inputs (also called control-inputs),
        Gθ⊂Uθ is a condition (predicate) over Uθ,
        ƒθ: Dψ→Dψ is a data-resetting function,
        hθ: Yψ→Yψ is an output-resetting function, and
        Tθ is a sample-period, Toθ is an offset.

When Gθ holds, ψ computes, and otherwise, hθ assigns the output. Also, when Gø becomes true, the first computation of ψ is preceded by a data-update by ƒθ. The “θ-conditioned ψ” system thus formed is denoted ψθ.

The conditioning-rule can be implemented by placing a system-block inside a certain Subsystem block (of Simulink Library) which can be configured to specify the conditioning parameters. Note a possible choice for conditioning is “null-conditioning”, denoted ⊥:=(−, True, id, id, ∞), in which case ψ⊥=ψ. (Here id denotes the identity function.)

    
    


Next we formally define the class of Simulink diagrams (also referred to as system-blocks) formed using the above rules.
Definition 4 A certain class of Simulink diagrams (also referred to as system-blocks) is recursively defined as follows.


    
    
        1. ψ is an atomic-block, then ψ is a system-block.
        2. Ψ is a set of system-blocks, C⊂(Ψ×N)2 is a set of interconnections, then C-connected Ψ, denoted Ψ/C, is a system-block.
        3. ψ is a system-block and θ is a conditioning over ψ, then θ-conditioned ψ, denoted ψθ, is a system-block.

Remark 2 For a system-block ψ:=Ψ/C, we have:

        inputs U ψ=Π∃((.,.),(ψ,i))εCUiψ,
        outputs Y ψ=ΠψεΨYψ,
        data D ψ=ΠψεΨDψ,
        initial data D0 ψ=ΠψεΨDψ, and
        sample-period, T ψ and offset To ψ are obtained using the rule defined in Remark 1 over {Tψ, Toψ|ψεΨ}.

Note the above definition of T ψ ensures that each computation of each system-block ψεΨ coincides with some computation of the connected system-block ψ (i.e., no computation of any system-block is missed).

Similarly, for a system-block ψ:=θ we have:

        inputs U ψ=Uψ×Uθ,
        outputs Y ψ=Yψ,
        data D ψ=Dψ,
        initial data D0 ψ=D0ψ
        sample-period
    
    






  
    T
    
      ψ
      _
    
  
  =
  
    {
    
      
        
          
            
              T
              θ
            
          
          
            
              if
              ⁢
              
                
              
              ⁢
              
                T
                θ
              
              ⁢
              
                
              
              ⁢
              specified
            
          
        
        
          
            
              T
              ψ
            
          
          
            otherwise
          
        
      
      ,
      
        

      
      ⁢
      
        
          and
          ⁢
          
            
          
          ⁢
          offset
          ⁢
          
            
          
          ⁢
          
            T
            o
            
              ψ
              _
            
          
        
        =
        
          {
          
            
              
                
                  T
                  o
                  θ
                
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  
                    T
                    θ
                  
                  ⁢
                  
                    
                  
                  ⁢
                  specified
                
              
            
            
              
                
                  T
                  o
                  ψ
                
              
              
                
                  otherwise
                  .
                
              
            
          
        
      
    
  




Note by the Simulink grammar, for a system-block ψ:=ψθ, Tθ is either specified and in which case T ψ is inherited to be Tθ, or is unspecified and in which case T ψ is inherited to be Tψ. Similarly for To ψ.

Example 2
Consider the Simulink diagram ψ of a counter shown in FIG. 1, where the Unit Delay block ψ5 is a discrete-time atomic-block and the block ψ1 is an Enabled Subsystem block. The output y5 increases by 1 at each sample-period when the control input u is positive, and y5 resets to its initial value when the control input u is not positive. The Saturation block ψ2 limits the value of y5 in the range between −0.5 and 7. The sample-period of ψ5 is 0.01 seconds and others are either constant (inf) or inherited (−1). Toψ5=0 by default since unspecified. Using get_param command after compiling ψ, Tψ=Tψi=0.01 for i=1, 2, 3, 4, 5. ψ belongs to the class of Simulink diagrams defined in Definition 4:

ψ={ψ1,ψ2}/C1,

where

    
    
        ψ1=({ψ3, ψ4, ψ5}/C2)θ, where
        
            C2={((ψ3, •),(ψ4, •)), ((ψ4, •),(ψ5, •)), (ψ5, •),(ψ4, •))},
            θ=(Uθ, uθ(k)>0, d(k)=d0, (y3(k), y4(k), y5(k))=(−, −, y50), −)
        
        
        C1={((ψ1, •),(ψ2, •))}, and
        ψ2, ψ3, ψ4, ψ5 are atomic-blocks.

Note since we choose the Pulse type of the source block Pulse Generator to be Time based, ψ is a single-rate Simulink diagram. Thus the source block for generating the inputs and the sink block Scope for displaying the outputs are not considered as part of the Simulink diagram being translated, and hence not included in ψ. If the Pulse type of the source block is chosen to be Sample based and the sample time is different from 0.01, then ψ becomes a multirate Simulink diagram.

    
    


Example 3
Consider the multirate Simulink diagram ψ shown in FIG. 2, where blocks ψ3 and ψ7 are discrete-time blocks with sample-period of 0.01 and 0.025 seconds, respectively. The Zero-Order Hold block ψ8 is also a discrete-time block that samples the incoming signal at 0.01. Blocks ψ5 and ψ6 are continuous-time blocks. The sample-periods of other blocks are either constant (inf) or inherited (−1). All offsets are 0 by default since unspecified. Thus, Tψi=0.01 for i=1, 2, 3, 4, 8 and Tψ7=0.025. Since gcd(0.01, 0.025)=0.005, we opt to discretize ψ5 and ψ6 at a sample-period of 0.005. Then Tψ5=Tψ6=0.005, and also Tψ=0.005.
ψ belongs to the class of Simulink diagrams defined in Definition 4: ψ=Ψ/C, where Ψ={ψ1, ψ2, ψ3, ψ4, ψ5, ψ6, ψ7, ψ8} and C is omitted. U=∅, D=D3×D5×D6×D7 with D0={(0, 0, 0, 0)}. Note the sink block Scope for displaying the outputs is not considered as part of the Simulink diagram being translated, and hence not included in ψ.
Example 4
Consider the Simulink diagram ψ of a bouncing ball shown in FIG. 3. ψ models a hybrid-system of a bouncing ball that is thrown up with an initial velocity of 15 m/s from an initial height of 10 m. y5 (resp., y2) is the position (resp., velocity) of the ball. ψ2 and ψ5 are continuous-time blocks. We have opted to discretize ψ2 and ψ5 at a sample period of 0.01. The sample-periods of other blocks are either constant (inf) or inherited (−1). Then Tψ=Tψi=0.01 for 1, . . . , 7. ψ belongs to the class of Simulink diagrams defined in Definition 4: ψ=Ψ/C,
where Ψ={ψ1, ψ2, ψ3, ψ4, ψ5, ψ6, ψ7} and C is omitted. U=∅, D=D1×D2 with D0={(15, 10)}.
4.1 Sorted-Order
When system-blocks are composed using the connecting-rule to form a more complex system-block, the input of one system-block becomes the output of another system-block. To respect the interdependency of the inputs/outputs, Simulink defines and uses the notion of an execution-order (which it refers as sorted-order) to determine the order in which the system-blocks included inside a connected system-block are executed. Note that the conditioning-rule does not require defining a sorted-order since it is applied to a single system-block.
Given a system-block Ψ/C formed using the connecting-rule, the sorted-order of the system-blocks {ψεΨ} is given as an ordering function Ord: Ψ→N, where N is the set of natural numbers. The sorted-order induces a total-order over Ψ, i.e., for ψ, ψ′εΨ, Ord(ψ)=Ord(ψ′) if and only if ψ=ψ′. Accordingly ψεΨ is executed before ψ′εΨ if Ord(ψ)<Ord(ψ′). The sorted-order value Ord(ψ) can be displayed, as part of a label ascribed to a system-block ψεΨ, by selecting the option Sorted Order from Simulink Block Displays menu. Assuming, without loss of generality of correctness of translation, that the Optimization on Conditional Execution Behaviors is turned off, the label ascribed to ψ has the format: Id(Ψ/C): Ord(ψ): {Id(ψ)}, where Id is a function that associates a certain identifier number to a system-block. The {Id(ψ)} part may be missing if ψ an atomic-block. Whenever we need to indicate the label ascribed to ψεΨ, we write it in the form: ψ [Id(Ψ/C): Ord(ψ){Id(ψ)}].
The notion of sorted-order is essential in defining the step of a system-block.
Definition 5 Given a system-block ψ and an input uεUψ, the step of ψ over u is recursively defined as follows:


    
    
        If ψ is an atomic-block, then the step of ψ over u is as defined in Definition 3.
        If ψ=Ψ/C is a connected system-block, then for jmin≦j≦jmax, where jmin=min{Ord(ψ): ψεΨ} and jmax=max{Ord(ψ): ψεΨ}, letting ψjεΨ denote the system-block with Ord(ψj)=j, a step of ψ over u is a sequence of steps, whose jth element is the step of ψjεΨ over uj, the input of ψj as determined by the set of connections C.
        If ψ=ψθ is a conditioned system-block, then a step of ψ over u is the step of ψ′ over u if Gθ holds, and otherwise it is the execution of the output-resetting function hθ. Also when Gθ becomes true, the first execution of the step of ψ′ over u is preceded by the execution of the data-resetting function ƒθ.

Given an input sequence {u(k)}k=0K, a step-trajectory of ψ over {u(k)}k=0K is a sequence of steps of ψ, where the kth step (0≦k≦K) in the sequence is over the input u(k). Letting y(k) (0≦k≦K) denote the output of ψ over u(k), {y(k)}k=0K is called the output of step-trajectory of ψ over {uk}k=0K.

    
    


Note in the 2nd item of Definition 5, when kTψ+T0ψ=kψjTψj+Toψj a step of ψj is computed by hiψj if Giψj holds, and kψj increases when k increases; otherwise when kTψ+Toψ≠kψjToψ+Toψj, the output of ψj remains its previous value, and kψj remains unchanged when k increases.
Example 5
Consider the Simulink diagram of ψ the counter shown in FIG. 1 that was also discussed in Example 2, and its sorted-order displayed in FIG. 1. We have

ψ=Ψ1/C1={ψ1[0:1{1}],ψ2[0:2]}/C1,

ψ1=(Ψ2/C2)θ=({ψ3[1:0],ψ4[1:2],ψ5[1:1]}/C2)θ.

Then according to Definition 5 we have:

    
    
        A step of ψ={ψ1, ψ2}/C1 is a step of ψ1 followed by a step of ψ2 since Ord(ψ1)<Ord(ψ2)=2.
        A step of ψ1=({ψ3, ψ4, ψ5}/C2)θ is obtained as follows: If Gθ holds, the sequence of steps of ψ3, ψ5, ψ4 is executed since Ord(ψ3)=0<Ord(ψ5)=1<Ord(ψ4)=2; and otherwise, hθ computes. Also when Gθ becomes true, the first execution of the sequence of steps of ψ3, ψ5, ψ4 is preceded by the computation of ƒθ.
    
    


Example 6
Consider the multirate Simulink diagram ψ of FIG. 2 that was also discussed in Example 3, and its sorted-order displayed in FIG. 2. It can be seen that

ψ={ψ1[0:2],ψ2[0:6],ψ3[0:7],ψ4[0:8],ψ5[0:3],ψ6[0:4],ψ7[0:0],ψ8[0:5]}/C. 

It then follows that a step of ψ is the sequence of steps of ψ7, ψ1, ψ5, ψ6, ψ8, ψ2, ψ3 and ψ4. Note for j=1, . . . , 8, a step of ψj is computed whenever kTψ=kψjTψj, and otherwise, ψj retains its previous values of the data and the output.

Example 7
Consider the Simulink diagram ψ of the bouncing ball of FIG. 3 that was also discussed in Example 4, and its sorted-order displayed in FIG. 3. It can be seen that

ψ={ψ1[0:7],ψ2[0:3],ψ3[0:2],ψ4[0:1],ψ5[0:5],ψ6[0:4],ψ7[0:0]}/C. 

It then follows that a step of ψ is the sequence of steps of ψ7, ψ4, ψ3, ψ2, ψ6, ψ5 and ψ1.

5. Semantic Translation of Simulink Diagrams
We describe how a Simulink diagram can be semantically translated to an I/O-EFA.
For any system-block ψ, its I/O-EFA model is obtained by connecting two I/O-EFA models, one for output-assignments and other for state-updates. We use l0−ψ, lm−ψ to denote the initial/final location for first I/O-EFA, and l0+ψ, lm+ψ to denote the initial/final location for second I/O-EFA. The two I/O-EFA's are connected using two edges:

    
    
        succession-edge connecting the final location lm−ψ of the first I/O-EFA to the initial location l0+ψ to of the second I/O-EFA, and
        time-advancement edge connecting the final location lm+ψ of the second I/O-EFA to the initial location l0−ψ to of the first I/O-EFA that increments time: k:=k+1.

Translating Atomic-Blocks. FIG. 4 depicts the two I/O-EFA models connected by the succession and time-advancement edges for an atomic-block ψ. A formal description of the translation is provided in the following algorithm.

Algorithm 1 For an atomic-block ψ=(Uψ. Yψ, Dψ, Doψ, {(Giψ, ƒiψ, hiψ)}i=1qψ, (Tψ, Toψ)),

    
    


The 1st I/O-EFA of ψ is

P−ψ=(L−ψ,−,Uψ,Yψ,−,−,l0−ψ,−,lm−ψ,E−ψ),

where

    
    
        L−ψ={l0−ψ,lm−ψ} and
        E−ψ={(l0−ψ, lm−ψ, −, −, Giψ, −, hiψ)|i≦qψ}.
    
    


The 2nd I/O-EFA of ψ is

P+ψ=(L+ψ,DPψ,Uψ,Yψ,−,−,l0+ψ,D0Pψ,lm+ψ,E+ψ),

where

    
    
        L+ψ={l0+ψ,lm+ψ},
        DPψ:=Dψ×K is the set of data, where K is the set of sampling times,
        D0Pψ:=D0ψ×{0} is the set of initial-data conditions, and
        E+ψ={(l0+ψ, lm+ψ, −, −, Giψ, ƒiψ, −)|i≦qψ}. 

Note that ƒψ=“nul” if ψ is a stateless block.

    
    


The combined I/O-EFA model of ψ is

Pψ=(Lψ,DPψ,Uψ,Yψ,−,−,l0ψ,D0Pψ,lmψ,Eψ),

where

    
    
        Lψ=L−ψ∪L+ψ,
        l0ψ=l0−ψ,
        lmψ=lm+ψ, and
        Eψ=E−ψ∪E+ψ∪{(lm−ψ, l0+ψ, −, −, −, −, −)}∪{(lm+ψ, l0−ψ−, −, −, −, k=k+1)}.

Translating for Connecting-rule. In the I/O-EFA models of a connected system-block ψ=Ψ/C, the initial and final locations of the first (resp., second) I/O-EFA are the initial and final locations of the first (resp., second) I/O-EFA model of ψεΨ that has the smallest and largest Ord(ψ)-value in Ψ, respectively. Also in order to preserve the sorted-order, there is an edge from the final location of the first (resp., second) I/O-EFA of ψεΨ to the initial location of the first (resp., second) I/O-EFA of ψ′εΨ if and only if Ord(ψ′)=Ord(ψ)+1. Also in order to allow multirate system-blocks within a connected system-block, certain “bypass” edges are introduced within each system-block ψεΨ connecting the initial location l0−ψ(resp., l0+ψ) and final location lm−ψ(resp., lm+ψ) of the first (resp., second) I/O-EFA of ψ. These edges are guarded by └kT ψ+T0 ψ≠kψTψ+T0ψ┘, implying that will be bypassed at those values of k when kT ψ+T0 ψ is not equal to kψTψ+T0ψ. In contrast, the converse guard condition of └kT ψ+To ψ=kψTψ+T0ψ┘ is introduced for the original set of edges originating at l0−ψ and l0+ψ. An illustration of the translating of ψ=Ψ/C is depicted in FIG. 5, whereas a formalization is presented in Algorithm 2.

    
    


Without loss of generality, we assume that if ((ψ, i),(ψ, j))εC, then yiψ=ujψ, i.e., the same variable has been used to denote the two signals.
Algorithm 2 For a connected system-block ψ=Ψ/C,
The 1st I/O-EFA of ψ is

P− ψ=(L− ψ,D−P ψ,U ψ,Y ψ,−,−,l0− ψ,D0−P ψ,lm− ψ,E− ψ),

where

    
    
        L− ψ:=∪ψεΨL−ψ,
        D−P ψ:=K×ΠψεΨKψ×T ψT0 ψ×ΠψεΨTψ×ΠψεΨT0ψ,
        U ψ and Y ψ are as defined in first part of Remark 2,
        l0− ψ=l0−ψ such that Ord(ψ)=min{Ord(ψ):ψεΨ},
        D0−P ψ={0}×ΠψεΨ{0}×T ψ×To ψ×ΠψεΨTψ×ΠψεΨToψ,
        lm− ψ:=lm−ψ such that Ord(ψ)=max{Ord(ψ):ψεΨ}, and
        E− ψ=∪ψ{(l0−ψ, lm−ψ, −, −, [kT ψ+To ψ=kψTψ+Toψ]^Giψ, −, hiψ)|i≦qψ}
        
            ∪{(l0−ψ, lm−ψ, −, −, └kT ψ+To ψ≠kψTψ+Toψ┐, −, yψ(k)=yψ(k−1))}
            ∪{(lm−ψ, l0−ψ′, −, −, −, −, −)|Ord(ψ′)=Ord(ψ)+1≦|Ψ|, and ψ, ψ′εΨ}.
        
        
    
    


The 2nd I/O-EFA of ψ is

P+ ψ=(L+ ψ,D+Pψ,U ψ,Y ψ,−,−,l0+ ψ,D0+P ψ,lm+ ψ,E+ ψ),

where

    
    
        L+ ψ:=∪ψεΨL+ψ,
        DP ψ:=D ψ×K×ΠψεΨKψ×T ψ×To ψ×ΠψεΨTψ×ΠψεΨToψ, where D ψ is as defined in first part of Remark 2,
        U ψ and Y ψ are as defined in first part of Remark 2,
        l0+ ψ=l0+ψ such that Ord(ψ)=min{Ord(ψ): ψεΨ},
        D0+P ψ=D0 ψ×{0}×ΠψεΨ{0}×T ψ×To ψ×ΠψεΨTψ×ΠψεΨToψ, where D0 ψ is as defined in first part of Remark 2,
        lm+ ψ:=lm+ψ such that Ord(ψ)=max{Ord(ψ): ψεΨ}, and
        E+ ψ=∪ψ{(l0+ψ, lm+ψ, −, −, [kT ψ+To ψ=kψTψ+Toψ]^Giψ,
        
            (dψ(k+1), kψ)=(θiψ, kψ+1), −)|i≦qψ}
            ∪ψ{(l0+ψ, lm+ψ, −, −, └kT ψ+To ψ≠kψTψ+Toψ┐, dψ(k+1)=dψ(k), −)}
            ∪{(lm+ψ, l0+ψ′, −, −, −, −, −)|Ord(ψ′)=Ord(ψ)+1≦|Ψ|, and ψ, ψ′εΨ}.
        
        
    
    


The combined I/O-EFA of ψ is

P ψ=(L ψ,DP ψ,U ψ,Y ψ,−,−,l0 ψ,D0P ψ,lm ψ,E ψ),

where

    
    
        L ψ:=L− ψ∪L+ ψ,
        DP ψ=D+P ψ,
        l0 ψ=l0− ψ,
        D0P ψ=D0+P ψ,
        lm ψ:=lm+ ψ, and
        E ψ=E− ψ∪E+ ψ∪{(lm− ψ, l0+ ψ, −, −, −, −, −)}∪{(lm+ ψ, l0− ψ, −, −, −, −, k=k+1)}.

Remark 3 If ψ is a single-rate system-block, then the I/O-EFA model of ψ=Ψ/C presented in Algorithm 2 can be simplified since in this case T ψ=Tψ and To ψ=Toψ for each ψεΨ and so kT ψ+To ψ=kψTψ+Toψ for each k.

Accordingly

E− ψ=∪ψE−ψ∪{(lm−ψ,l0−ψ′,−,−,−,−,−)|Ord(Ψ′)=Ord(Ψ)+1≦|Ψ|, and ψ,ψ′εΨ}, and

E+ ψ=∪ψE+ψ∪{(lm+ψ,l0+ψ′,−,−,−,−,−)|Ord(Ψ′)=Ord(Ψ)+1≦|Ψ|, and ψ,ψ′εΨ}.

    
    


Example 8
Consider Ψ2/C2={ψ3, ψ4, ψ5}/C2 of Example 2, where Ord(ψ3)<Ord(ψ5)<Ord(ψ4). The I/O-EFA model for Ψ2/C2, obtained using Algorithm 2 for the connecting-rule and Remark 3, is shown in FIG. 6. The dotted boxes contain the 1st/2nd I/O-EFAs of ψεΨ2, and also of Ψ2/C2.
Example 9
Consider the multirate Simulink diagram of FIG. 2 that was discussed in Example 3. The I/O-EFA model of ψ, obtained using Algorithm 2 for the connecting-rule, is shown in FIG. 7.
Translating for Conditioning-rule. In the translation of a conditioned system-block ψ=ψθ, the 1st I/O-EFA of ψ is the 1st I/O-EFA of ψ together with (i) a newly added location l0− ψ, that also serves as the initial location of the first I/O-EFA model of ψ, (ii) two newly added edges for capturing the conditional execution of ψ, and (iii) a “bypass edge” when the condition Gθ doesn't hold. The 2nd I/O-EFA of ψ is the 2nd I/O-EFA of ψ together with (i) a newly added location l0+ ψ, that also serves as the initial location of the second I/O-EFA model of ψ, (ii) a newly added edge for capturing the conditional execution of ψ, and (iii) a “bypass edge” when the condition Gθ doesn't hold. An extra binary-valued data-variable dθ, with initial value 0, is introduced to keep track of the period over which Gθ holds. An illustration of the translating of ψ=ψθ is depicted in FIG. 8, whereas a formalization is presented in Algorithm 3.

Algorithm 3 For a conditioned system-block ψ=ψθ,

The 1st I/O-EFA model of ψ is

P− ψ=(L− ψ,Dθ,U ψ,Y ψ,−,−,l0− ψ,D0θ,lm− ψ,E− ψ),

where

    
    
        L− ψ=L−ψ∪{l0− ψ},
        Dθ={0, 1},
        U ψ and Y ψ are as defined in second part of Remark 2,
        D0θ={0},
        lm− ψ=lm−ψ, and
        E−ψ=E−ψ∪{(l0− ψ, l0−ψ, −, −, Gθ^[dθ=0],(ƒθ; dθ:=1), −)}∪ {(l0− ψ, l0−ψ, −, −, Gθ^[dθ=1], −, −)}∪{(l0− ψ, lm−ψ, −, −, Gθ, −, hθ)}.
    
    


The 2nd I/O-EFA model of ψ is

P+ ψ=(L+ ψ,DP ψ,U ψ,Y ψ,−,−,l0+ ψ,D0P ψ,lm+ ψ,E+ ψ),

where

    
    
        L+ ψ=L+ψ∪{l0+ ψ},
        DP ψ=DPψ×Dθ,
        D0P ψ=D0Pψ×D0θ,
        lm+ ψ=lm+ψ, and
        E+ ψ=E+ψ∪{(l0+ ψ, l0+ψ, −, −, Gθ, −, −)}∪
        
            {(l0+ ψ lm+ψ, −, −,  Gθ, (dψ(k+1), dθ)=(dψ(k), 0), −)}.
        
        
    
    


The combined I/O-EFA model of ψ is

P ψ=(L ψ,DP ψ,U ψ,Y ψ,−,−,l0 ψ,D0P ψ,lm ψ,E ψ),

where

    
    
        L ψ=L− ψ∪L+ ψ,
        l0 ψ=l0− ψ,
        lm ψ=lm+ψ, and
        E ψ=E− ψ∪E+ ψ∪{(lm−ψ, l0+ψ, −, −, −, −, −)}∪{(lm+ψ, l0− ψ, −, −, −, −, k=k+1)}.

Remark 4 Algorithms 1, 2 and 3 provide translation under the fixed-step simulation semantics of Simulink. The algorithms can be modified to follow the variable-step simulation semantics as well. The variable-step solvers in the Simulink dynamically increase (or reduce) the step size (i.e., the value of T ψ) if the error exceeds (or falls under) a specific limit Erceiling (or Erfloor) To see the modification, suppose the error calculation formula is ƒe(y ψ(k), y ψ(k−1), . . . , T ψ). Then the time-advancement edge (lm+ψ, l0− ψ, −, −, −, −, k=k+1) will be replaced by the following set of edges:

{(lm+ψ,l0− ψ,−,−,[ƒeErceiling],T ψ=T ψ/2,k=k+1),(lm+ψ,l0− ψ,−,−,[θeErfloor],T ψ=2*T ψ,k=k+1)

(lm+ψ,l0− ψ,−,−,[ErfloorƒeEƒceiling],−,k=k+1)}.

    
    


Example 10
Consider ψ1=(Ψ2/C2)θ of Example 2. The I/O-EFA model of Ψ2/C2 was obtained in Example 8, and the I/O-EFA model of ψ1, obtained using Algorithm 3 for the conditioning-rule, is shown in FIG. 9. The dotted boxes contain the 1st/2nd I/O-EFAs of Ψ2/C2, and also of ψ1.
Example 11
Consider the Simulink diagram ψ={ψ1, ψ2}/C of the counter shown in FIG. 1 that was also discussed in Example 2. The I/O-EFA model for ψ1 was obtained in Example 10, and the I/O-EFA model of ψ, obtained using Algorithm 2 for the connecting-rule and Remark 3, is shown in FIG. 10.
Consider the Simulink diagram ψ of the bouncing ball of FIG. 3, and also discussed in Example 4. The I/O-EFA model of ψ, obtained using Algorithm 2 for the connecting-rule and Remark 3, is shown in FIG. 11.
6. Validation of Translating Approach
In order to show that the translating approach is sound and complete, we introduce the concept of a step and of a step-trajectory of an I/O-EFA model of a system-block. In the I/O-EFA model Pψ of a system-block ψ, each increment of k corresponds to an execution of a path π=(l0ψ, . . . , lmψ, l0ψ). A computation along the kth execution of such a path gives an output value y(k) for an input u(k).
Definition 6 Given an I/O-EFA model Pψ of a system-block ψ and input uε∪ψ, a step of Pψ over u is the computation of a sequence of edges starting from l0ψ and ending at lmψ, followed by the time-advancement edge. Given an input sequence {u(k)}k=0K, a step-trajectory of Pψ over {u(k)}k=0K is a sequence of steps, where the kth step (0≦k≦K) in the sequence is over the input u(k). Letting y(k) (0≦k≦K) denote the output of ψ over u(k), {y(k)}k=0K is called the output of step-trajectory of Pψ over {uk}k=0K.
Next we show that the input-output behavior of an I/O-EFA model at a sampling time, defined in terms of a step, preserves the input-output behavior of the corresponding Simulink diagram at the same sampling time, defined in terms of a step.
Lemma 1 Given a system-block ψ and an input u(k) and at the kth sampling time, let yψ(k) and yPψ(k) be the outputs of the steps of ψ and Pψ, respectively, over u(k). Then yψ(k)=yPψ(k), where Pψ is obtained from the Algorithms 1, 2 and 3.
Proof: If ψ is an atomic-block, then from Algorithm 1 and Definitions 5 and 6, a step of both ψ and Pψ at the kth sampling time k compute: yψ(k)=hiψ(d(k),u(k)), where




  
    
      d
      ⁡
      
        (
        k
        )
      
    
    =
    
      {
      
        
          
            
              
                f
                i
                ψ
              
              ⁡
              
                (
                
                  
                    d
                    ⁡
                    
                      (
                      
                        k
                        -
                        1
                      
                      )
                    
                  
                  ,
                  
                    u
                    ⁡
                    
                      (
                      
                        k
                        -
                        1
                      
                      )
                    
                  
                
                )
              
            
          
          
            
              
                if
                ⁢
                
                  
                
                ⁢
                k
              
              >
              0
            
          
        
        
          
            
              d
              0
            
          
          
            otherwise
          
        
      
      }
    
  
  ,




if Giψ(d(k),u(k)) holds, and

i≦qψ.
If ψ=Ψ/C, then from Algorithms 2 and Definitions 5 and 6, a step of both ψ and Pψ over u(k) at the kth sampling time compute (yψjmin(k), . . . , yψj(k), . . . , yψjmax(k)), where ψjεΨ and:
(i) If kTψ+Toψ=kψjTψj+Toψj:yψj(k)=(d(k),u(k)), where




  
    d
    ⁡
    
      (
      k
      )
    
  
  =
  
    {
    
      
        
          
            
              f
              i
              
                ψ
                j
              
            
            ⁡
            
              (
              
                
                  d
                  ⁡
                  
                    (
                    
                      k
                      -
                      1
                    
                    )
                  
                
                ,
                
                  u
                  ⁡
                  
                    (
                    
                      k
                      -
                      1
                    
                    )
                  
                
              
              )
            
          
        
        
          
            
              if
              ⁢
              
                
              
              ⁢
              k
            
            >
            0
          
        
      
      
        
          
            d
            0
          
        
        
          otherwise
        
      
    
    }
  




if Giψj(d(k),u(k)) holds,

i≦qψj, and
urψj(k)=ysψj′(k) if ((ψj,r),(ψj′,s))εC
(ii) If kTψ+Toψ≠kψj+Toψj:yψj(k)=yψj(k−1).
If ψ=ψθ, then from Algorithms 3 and Definitions 5 and 6, a step of both ψ and Pψ over u(k) at the kth sampling time compute:



  
    
      
        
          y
          
            ψ
            _
          
        
        ⁡
        
          (
          k
          )
        
      
      =
      
        {
        
          
            
              
                
                  h
                  i
                  ψ
                
                ⁡
                
                  (
                  
                    
                      
                        d
                        ψ
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    ,
                    
                      
                        u
                        ψ
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                  
                  )
                
              
            
            
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      
                        G
                        θ
                      
                      ⁡
                      
                        (
                        
                          u
                          ⁡
                          
                            (
                            k
                            )
                          
                        
                        )
                      
                    
                    ⋀
                    
                      
                        G
                        i
                        ψ
                      
                      ⁡
                      
                        (
                        
                          
                            
                              d
                              ψ
                            
                            ⁡
                            
                              (
                              k
                              )
                            
                          
                          ,
                          
                            
                              u
                              ψ
                            
                            ⁡
                            
                              (
                              k
                              )
                            
                          
                        
                        )
                      
                    
                  
                  ⁢
                  holds
                
                ,
              
            
          
          
            
              
                
                  h
                  θ
                
                ⁡
                
                  (
                  
                    
                      
                        d
                        ψ
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                    ,
                    
                      
                        u
                        ψ
                      
                      ⁡
                      
                        (
                        k
                        )
                      
                    
                  
                  )
                
              
            
            
              
                otherwise
                ,
              
            
          
        
        }
      
    
    ,
    
      

    
    ⁢
    
      
    
    ⁢
    where
  




  
    
      
        d
        ψ
      
      ⁡
      
        (
        k
        )
      
    
    =
    
      {
      
        
          
            
              {
              
                
                  
                    
                      
                        f
                        θ
                      
                      ⁡
                      
                        (
                        
                          
                            
                              d
                              ψ
                            
                            ⁡
                            
                              (
                              
                                k
                                -
                                1
                              
                              )
                            
                          
                          ,
                          
                            
                              u
                              ψ
                            
                            ⁡
                            
                              (
                              
                                k
                                -
                                1
                              
                              )
                            
                          
                        
                        )
                      
                    
                  
                  
                    
                      
                        
                          if
                          ⁢
                          
                            
                          
                          ⁢
                          k
                        
                        ⁢
                        
                          
                        
                        〉
                      
                      ⁢
                      
                        
                      
                      ⁢
                      0
                    
                  
                
                
                  
                    
                      d
                      0
                      ψ
                    
                  
                  
                    otherwise
                  
                
              
              }
            
          
          
            
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        G
                        θ
                      
                      ⁡
                      
                        (
                        
                          u
                          ⁡
                          
                            (
                            k
                            )
                          
                        
                        )
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    becomes
                    ⁢
                    
                      
                    
                    ⁢
                    true
                  
                
              
              
                
                  
                    at
                    ⁢
                    
                      
                    
                    ⁢
                    the
                    ⁢
                    
                      
                    
                    ⁢
                    kth
                    ⁢
                    
                      
                    
                    ⁢
                    sampling
                    ⁢
                    
                      
                    
                    ⁢
                    time
                  
                
              
            
          
        
        
          
            
              
                f
                i
                ψ
              
              (
              
                
                  
                    d
                    ψ
                  
                  ⁡
                  
                    (
                    
                      k
                      -
                      1
                    
                    )
                  
                
                ,
                
                  
                    u
                    ψ
                  
                  ⁡
                  
                    (
                    
                      k
                      -
                      1
                    
                    )
                  
                
              
              )
            
          
          
            
              if
              ⁢
              
                
              
              ⁢
              
                
                  G
                  θ
                
                ⁡
                
                  (
                  
                    u
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  )
                
              
              ⁢
              
                
              
              ⁢
              remains
              ⁢
              
                
              
              ⁢
              true
            
          
        
        
          
            
              {
              
                
                  
                    
                      
                        d
                        ψ
                      
                      ⁡
                      
                        (
                        
                          k
                          -
                          1
                        
                        )
                      
                    
                  
                  
                    
                      
                        
                          if
                          ⁢
                          
                            
                          
                          ⁢
                          k
                        
                        ⁢
                        
                          
                        
                        〉
                      
                      ⁢
                      
                        
                      
                      ⁢
                      0
                    
                  
                
                
                  
                    
                      d
                      0
                      ψ
                    
                  
                  
                    otherwise
                  
                
              
              }
            
          
          
            otherwise
          
        
      
    
  



The following proposition shows that the input-output behavior of an I/O-EFA model over a sequence of sampling times, defined in terms of a step-trajectory, preserves the input-output behavior of the corresponding Simulink diagram over the same sequence of sampling times, defined in terms of a step-trajectory.
Proposition 1 Given a system-block ψ and an input sequence {u(k)}k=0K, let {y ψ(k)}k=0K and {yP ψ(k)}k=0K be the outputs of step-trajectories of ψ and Pψ, respectively, over {u(k)}k=0K. Then {y ψ(k)}k=0K={yP ψ(k)}k=0K, where P ψ is as obtained from the Algorithms 1, 2 and 3.

Proof: The proof follows from Lemma 1 and Definitions 5 and 6.

Example 12
To validate our model, a simulation for a certain input sequence (pulse with period 1.2 second and pulse width 25%) was obtained for the Simulink diagram ψ of FIG. 1 (using fixed-step discrete solver) and is shown in FIG. 12. The simulation of the I/O-EFA model Pψ was done in Stateflow. Since a step of Pψ is defined to be the execution of a cycle starting from and ending at the initial location and visiting the final location once, the sample period for the Stateflow model of Pψ was scaled down by the length of the cycle (the number of locations of Pψ). The simulation result of Pψ (using fixed-step discrete solver) is also shown in FIG. 12.
A simulation was obtained for the multirate Simulink diagram ψ of FIG. 2 (using fixed-step continuous solver odel Euler) and is shown in FIG. 13. The simulation of the I/O-EFA model Pψ was done in Stateflow (note the computer cannot check the equality of two floating numbers, one way to handle this is to duplicate the set of Tψs and Toψs, relabel and amplify them to make them integers). Recall Tψ=0.005. The sample-period for the Stateflow model of Pψ was scaled down by the number of locations of Pψ. The simulation result of Pψ (using fixed-step discrete solver) is also shown in FIG. 13.
A simulation was obtained for the Simulink diagram ψ of FIG. 3 (using fixed-step continuous solver odel Euler) and is shown in FIG. 14. The simulation of the I/O-EFA model Pψ was done in Stateflow. Recall the sample-period of ψ is 0.01. The sample-period for the Stateflow model of Pψ was scaled down by the number of locations of Pψ. The simulation result of Pψ (using fixed-step discrete solver) is also shown in FIG. 14.
7. Related Work
We briefly introduce the works related to ours, discussing succinctly their features. [4] presented a translation algorithm for converting a restricted subclass of S/S diagrams into a semantically equivalent hybrid automaton. For the subclass of S/S diagrams considered there exists a clear separation between the discrete and the continuous dynamics: All mode changes are made through switches, and whose controlling variables are restricted to be the outputs of the Stateflow modules. In general, however, the discrete modes do not have to be determined by the output variables of the Stateflow modules, and switches do not have to be used to switch continuous dynamics. Our approach does not require a clear separation between discrete and continuous dynamics for modeling hybrid systems. Also our translation approach has no special restriction on the types of Simulink blocks. The approach supports virtually all blocks in Simulink Library (in this work we only consider time-driven blocks) provided that the block can be mathematically written as input-state-output functions over time. [5] described a translation scheme for deriving hybrid automata models from S/S models. However, no formal algorithms are provided. We presented formal algorithms for the translation. [3, 6, 13] describes a technique for translating discrete-time Simulink diagrams into Lustre programs. Lustre is a synchronous language and the translation is a mapping between elements of Simulink diagrams (for example, signals and atomic blocks) and Lustre programs (for example, flows and operators/nodes). The execution sequence of Simulink blocks in the Lustre programs is determined by Lustre compiler. Also only the discrete-time blocks are translated. In our approach, the execution sequence of Simulink blocks is directly captured in the I/O-EFA models. Also, our approach supports virtually all time-driven blocks in Simulink Library. [7] mentioned a translation of S/S diagrams into the language of “SAL [1] for the purposes of test generation. However, the details of the translation were not given. [8] reported translation of Simulink diagrams to a model of concurrent processes communicating with FIFO queues or registers, called SPI model, in contrast to I/O-EFA model in our approach. There has also been work on code-generation for simulink diagrams [12, 11]. One emphasis is in intellectual property reuse (i.e., code reuse for a group of atomic blocks) and so their approach is modular. In contrast we focus on formal modeling of Simulink diagrams with the goal of providing models that are readily amenable for further analysis (verification, test-generation, etc.).
8. Conclusion
We presented a recursive approach for translating a class of Simulink diagrams as input/output-extended finite automata (I/O-EFA), which is amenable to automated test generation or verification. We treat the blocks in the Simulink library to be “atomic” and formulate two rules used in Simulink for building complex blocks by combining the simpler ones. We provided a recursive and formal definition for the class of Simulink diagrams formed using these rules.
We presented algorithms for (i) translating an atomic-block as an I/O-EFA, (ii) combining the I/O-EFA models of simpler Simulink diagrams to build the I/O-EFA model of a more complex Simulink diagram, constructed using certain rules of composition. We introduced the concept of a step (resp., step-trajectory) of an I/O-EFA to emulate the computation of a Simulink diagram at a sample time (resp., over a sequence of sample times). We showed that the translating approach is sound and complete: The input-output behavior of an I/O-EFA model, as defined in terms of a step-trajectory preserves the input-output behavior of the corresponding Simulink diagram at each sample time (assuming the same integration method for any of the continuous blocks with dynamics). Finally, the translation approach has no specific restriction on the types of Simulink blocks or the structure of Simulink diagrams supported and can handle multirate Simulink diagrams, sample times with initial offsets and variable-step simulation etc.
Although various embodiments have been shown and described in detail, the present invention is not to be limited to the specific embodiments shown as the present invention contemplates numerous variations, options, and alternatives in its implementation as may be appropriate in various situations. For example, the present invention contemplates that different types of diagrams may be used. The methodology may be implemented in various types of computing devices using any number of types of software to provide instruction sets for performing the logic of the methodologies described herein.
REFERENCES
References below are incorporated by reference in their entireties.


    [1] Sal homepage. http://sal.csl.sri.com/.
    [2] Simulink. http://www.mathworks.com/products/simulink/.
    [3] P. Caspi, A. Curic, A. Maignan, C. Sofronis, and S. Tripakis. Translating discrete-time simulink to lustre. Lecture Notes in Computer Science, 2855:84-99, 2003.
    [4] A. Agrawal, G. Simon, and G. Karsai. Semantic translation of simulink/stateflow models to hybrid automata using graph transformations. Electronic Notes in Theoretical Computer Science, 109:43-56, December 2004.
    [5] R. Alur, A. Kanade, S. Ramesh, and K. C. Shashidhar. Symbolic analysis for improving simulation coverage of simulink/stateflow models. In EMSOFT '08: Proceedings of the 7th ACM international conference on Embedded software, pages 89-98, New York, N.Y., USA, 2008. ACM.
    [6] P. Caspi, A. Curic, A. Maignan, C. Sofronis, S. Tripakis, and P. Niebert. From simulink to scade/lustre to tta: a layered approach for distributed embedded applications. SIGPLAN Not., 38(7):153-162, 2003.
    [7] A. Gadkari, S. Mohalik, K. C. Shashidhar, J. Suresh A Yeolekar, and S. Ramesh. Automatic generation of test cases using model checking for sl/sf models. Workshop on Model-Driven Engineering, Verification, and Validation, 2007.
    [8] M. Jersak, D. Ziegenbein, F. Wolf, K. Richter, R. Ernst, F. Cieslog, J. Teich, K. Strehl, and L. Thiele. Embedded system design using the spi workbench. In Proc. of the 3rd International Forum on Design Languages, 2000.
    [9] R. Kumar, C. Zhou, and S. Basu. Finite bisimulation of reactive untimed infinite state systems modeled as automata with variables. In Proceedings of the 25th American Control Conference, pages 6057-6062, Minneapolis, Minn., June 2006.
    [10] D. Lee and M. Yannakakis. Principles and methods of testing finite state machines—a survey. Proceedings of the IEEE, 84(8):1090-1123, 1996.
    [11] R. Lublinerman, C. Szegedy, and S. Tripakis. Modular code generation from synchronous block diagrams—modularity vs. code size. In POPL'09, 2009.
    [12] R. Lublinerman and S. Tripakis. Modular code generation from triggered and timed block diagrams. In Real-Time and Embedded Technology and Applications Symposium (RTAS'08), 2008.
    [13] N. Scaife, C. Sofronis, P. Caspi, S. Tripakis, and F. Maraninchi. Defining and translating a “safe” subset of simulink/stateflow into lustre. In Proc. EMSOFT'04, 2004.
    [14] T. Takenaka, K. Okano, T. Higashino, and K. Taniguchi. Symbolic model checking of extended finite state machines with linear constraints over integer variables. Syst. Comput. Japan, 37(6):64-72, 2006.
    [15] C. Zhou and R. Kumar. On identification of input/output extended automata with finite bisimilar quotients. In 2009 American Control Conference, St. Louis, Mo., June 2009.

## Claims

1. A method of semantic translation of a diagram associated with a graphical modeling environment into an input/output-extended finite automata (I/O-EFA) model, the method comprising:
receiving a representation of the diagram at a computing device;
processing the representation of the diagram with the computing device by (a) representing all atomic blocks in said diagram as a tuple, (b) representing the diagram using a connecting rule and a conditioning rule, (c) determining an order in which the blocks included inside the diagram are executed, (d) translating the atomic blocks into the I/O-EFA model using a first algorithm, and (e) translating for the connecting rule and the condition rule using a second algorithm and a third algorithm, respectively to thereby modify the I/O-EFA model; and
storing the I/O-EFA model on a non-transitory computer readable storage medium.

2. The method of claim 1 wherein the step of processing is performed by the computing device according to an instruction set stored on the non-transitory computer readable storage medium.

3. The method of claim 1 wherein the diagram is a diagram associated with a graphical block diagramming tool.

4. The method of claim 1 wherein the diagram represents a hybrid system combining event-driven discrete and time-dependent continuous behaviors.

5. The method of claim 1 wherein the diagram represents a system with time-dependent continuous behaviors and wherein the input/output-extended finite automata model represents a reactive untimed infinite state system and wherein input-state-output behavior of the I/O-EFA preserves input-state-output behavior of the diagram at each sample time.

6. The method of claim 1 wherein the diagram represents multi-rate systems and comprises blocks with sample times having initial offsets and wherein input-state-output behavior of the diagram is obtained by variable-step solvers.

7. The method of claim 1 wherein the diagram comprises mathematically representable automic blocks and rules of combining automic blocks to form complex blocks.

8. The method of claim 1 wherein the input/output-extended finite automata model is defined as a tuple wherein
L is a set of locations (symbolic-states),
D=D1 Dn is a set of typed data (numeric-states),
U=U1 Um is a set of typed numeric-inputs,
Y=Y1 Yp is a set of typed numeric-outputs,
is a set of symbolic-inputs,
Δ is a set of symbolic-outputs,
is an initial location,
D0 D is a set of initial-data values,
is a final location, and
E is a set of edges, and each e E is a 7-tuple,
where
oe L is an origin location,
te L is a terminal location,
is a symbolic-input,
is a symbolic-output,
Ge D U is an enabling guard (a predicate),
is a data-update function, and
is an output-assignment function.

9. A non-transitory computer-readable storage medium storing computer-executable instructions that are executed on a processing device, the computer-executable instructions comprising:
instructions for receiving a data representation of a diagram, said diagram comprising a plurality of blocks and said diagram being associated with a graphical modeling environment in which blocks within the diagram define semantics for executing the diagram; and
instructions for processing the data representation of the diagram to translate the diagram into an input/output-extended finite automata model.

10. The non-transitory computer readable storage medium of claim 9 wherein the instructions for processing the data representation of the diagram to translate the diagram into the input/output-extended finite automata model provide for (a) representing all atomic blocks in said diagram as a triple, (b) representing the diagram using a connecting rule and a conditioning rule, (c) determining an order in which the blocks included inside the diagram are executed, (d) translating the atomic blocks into the I/O-EFA model using a first algorithm, and (e) translating for the connecting rule and the conditioning rule using a second algorithm and a third algorithm, respectively to thereby modify the I/O-EFA model.

11. The non-transitory computer readable storage medium of claim 10 wherein the diagram represents a system with time-dependent continuous behaviors and wherein the input/output-extended finite automata model represents a reactive untimed infinite state system and wherein input-state-output behavior of the I/O-EFA preserves input-state-output behavior of the diagram at each sample time.

12. The non-transitory computer readable storage medium of claim 10 wherein the diagram represents multi-rate systems and comprises blocks with sample times having initial offsets and wherein input-state-output behavior of the diagram is Obtained by variable-step solvers.

13. The non-transitory computer readable storage medium of method of claim 10 wherein the diagram comprises mathematically representable automic blocks and rules of combining automic blocks to form complex blocks.

14. The non-transitory computer readable storage medium of claim 9 wherein the diagram represents a hybrid system combining event-driven discrete and time-dependent continuous behaviors.

15. The non-transitory computer readable storage medium of claim 10 wherein the input/output-extended finite automata model is defined as a tuple wherein
L is a set of locations (symbolic-states),
D=D1 Dn is a set of typed data (numeric-states),
U=U1 Um is a set of typed numeric-inputs,
Y=Y1 Yp is a set of typed numeric-outputs,
is a set of symbolic-inputs,
Δ is a set of symbolic-outputs,
is an initial location,
D0 D is a set of initial-data values,
is a final location, and
E is a set of edges, and each e E is a 7-tuple,
where
oe L is an origin location,
te L is a terminal location,
is a symbolic-input,
is a symbolic-output,
Ge D U is an enabling guard (a predicate),
is a data-update function, and
is an output-assignment function.

16. A method of semantic translation of a diagram into input/output-extended finite automata (I/O-EFA) model, the method comprising:
(i) representing atomic blocks in the diagram as a tuple;
(ii) representing the diagram using a connecting-rule and a conditioning-rule;
(iii) determining an order in which the atomic blocks of the diagram are executed;
(iv) translating the atomic-blocks into an I/O-EFA model;
(v) translating for the connecting-rule and the conditioning-rule to adjust the I/O-EFA model;
(vi) storing the I/O-EFA model on a non-transitory computer readable storage medium;
wherein steps (i) to (v) are performed by a computing device.

17. A system comprising logic performing the method of claim 16 embodied on at least one non transitory computer readable medium.

18. A method of translating a class of diagrams as input/output-extended finite automata, the method comprising:
receiving a data representation of a diagram at a computing device, said diagram comprising a plurality of blocks and said diagram being associated with a graphical modeling environment which defines semantics for executing the diagram;
processing using the computing device the data representation of the diagram to translate the diagram into an input/output-extended finite automata model; and
storing the input/output-extended finite automata model on a non-transitory computer readable storage medium.