Journal of Applied Mathematics

Volume 2014 (2014), Article ID 850789, 5 pages

http://dx.doi.org/10.1155/2014/850789

## Approximate Equivalence of the Hybrid Automata with Taylor Theory

^{1}Chengdu Institute of Computer Application, Chinese Academy of Sciences, Chengdu 610041, China^{2}Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Guangxi University for Nationalities, Guangxi 530006, China^{3}Institute of Acoustics, Chinese Academy of Sciences, Beijing 100190, China

Received 26 January 2014; Revised 7 April 2014; Accepted 22 April 2014; Published 11 May 2014

Academic Editor: Guiming Luo

Copyright © 2014 Anping He et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Hybrid automaton is a formal model for precisely describing a hybrid
system in which the computational processes interact with the physical
ones. The reachability analysis of the polynomial hybrid automaton is
decidable, which makes the *Taylor* approximation of a hybrid automaton
applicable and valuable. In this paper, we studied the simulation relation
among the hybrid automaton and its Taylor approximation, as well as
the approximate equivalence relation. We also proved that the Taylor approximation simulates its original hybrid automaton, and similar hybrid
automata could be compared quantitatively, for example, the approximate equivalence we proposed in the paper.

#### 1. Introduction

Hybrid automaton is a formal model of a hybrid system in which computational processes interact with the physical ones. Similar to other automata, the hybrid one also contains states and transitions, but it labels and groups all closely related states as an activity to express continuous behaviour by a* state function*; moreover, it also employs functions to update variable values while transiting from an activity to another. In short, a hybrid automaton shows the hybrid behaviour composed of the discrete state transitions and continuous state evolution.

Most hybrid systems are safety critical applications, which require guarantees of safe operations; the unwarrantable configurations must be unreached. Formally, we can validate these safety properties by* reachability* analysis, for example, the forward or backward iteration with initial conditions, activities, and so on. However, for most types of hybrid automata, the computation of the iteration may not halt and then leads to an undecidable reachability analysis. Luckily, there exists one type of hybrid automaton called the polynomial hybrid automaton; its reachability analysis is proved decidable. Then it is very valuable to construct an approximate polynomial hybrid automaton of a common one. In [1], the authors build the polynomial one in terms of Taylor theory.

In this paper, we study the relation of the hybrid automaton and its Taylor approximation in terms of the semantic models, for example, how different similar automata behave, and then the quantitative comparison of the automata. We find that the automaton and its approximation show a simulation relation; furthermore, fortunately, we propose a quantitative equivalence of similar hybrid automata in terms of simulation. To our knowledge, there seems no work done for this.

##### 1.1. Related Works

The hybrid automaton was introduced in [2, 3] with analysis for the linear and nonlinear one and some simple examples, and, in [4], the authors focus on its verification aspect. There are many works on verification and analysis of hybrid automata; [2, 4–6] studied the model checking of hybrid automata; [2, 3, 7] performed reachability analysis; [8, 9] showed some achievements of probabilistic hybrid automata; [10] studied the hybrid automata by a domain-theoretic semantics.

The behavior of hybrid system is so complex that the approximation of the system is necessary in most of applications. In [2], authors found the reachability of the multirated simple hybrid automata is decidable. Several papers (see, e.g., [1, 2, 7, 11, 12]) tried to classify hybrid automata, for example, a specific type of automaton satisfies the properties if its approximation holds the same ones. Other papers (see, e.g., [13–15]) were concerned with the way of analyzing classes of hybrid systems for which the strategy previously described does not work.

In [1], the authors approximated syntactically an automaton with in terms of Taylor theory and then studied also how close the behaviors of and are. However, they missed the relation between and in a behaviour view, nevertheless, the quantitative equivalence based on the relation was not considered either.

##### 1.2. Organization of the Paper

The paper is organized as follows: in Section 2 we recall the definition of hybrid automata and their Taylor approximations; in Section 3 we study the simulation and approximation and then prove a hybrid automaton being simulated by its Taylor approximation; in Section 4 we propose a Taylor -relation and then prove this relation is an equivalence; we concluded in Section 5.

#### 2. Taylor Approximation of Hybrid System

Let us show the formal definition of a hybrid automaton.

*Definition 1. *A hybrid automaton is a tuple . (i) is vector of real variables.(ii) is initial condition.(iii) is finite set of states.(iv) is the initial state.(v) is a set of events symbol.(vi)Act is the activity function assigning to each state a formula . The variable represents time elapsing.(vii) is a set of transitions. Variables represent the new values taken by the variables after the transition: :(a), that ,(b) .(viii)Event is event mapping function attaching each transition an event name.

There are many similar definitions of hybrid automata, such as ones in [2, 3]. Generally, the hybrid automata behave in two ways, namely, an internal* flow* and state* jump* transition. The flow is a stutter at states which shows the continuous behavior of a hybrid automaton, for example, a variation that does not involve states switching but updates value of variables only. In contrast, jump transition always switches states. Let , , and be time elapsing. We denote the flow as below:
and jump

The basic way of analyzing a hybrid automaton is* reachability analysis*, which involves computing the forward or backward reachable regions of a hybrid automaton from initial conditions recursively [1, 2]. However, in most cases, the computing failed because of the nondecidability of the reachabilty analysis.

There are many aspects that can be adopted to classify the hybrid automata; one of them concerns the mathematical expressions; for example, a hybrid automaton is a* polynomial hybrid automaton* if and only if is a polynomial formula; for each state , is a polynomial formula, and for each transition , is a polynomial formula. Researchers and engineers try their best to find the polynomial hybrid automaton, or even an approximated one, of a real system, because the problem of reachability in steps for polynomial hybrid automata is decidable [16, 17].

It is clear that the most types of hybrid automata do not belong to the polynomial ones; then it is valuable to study a polynomial approximation of a hybrid automaton. Ruggero Lanotte and Simone Tini proposed polynomial approximation of a generic hybrid automaton in [1] in terms of Taylor approximation theory. The following is the definition of Taylor approximation of a hybrid automaton .

*Definition 2. *Let be a hybrid automaton; all functions appearing in its formulae are derivable times. The approximation of rank for is the polynomial hybrid automaton . (i)Each formula in , , and is derived from by replacing each nonpolynomial subformula in with
where stays for either , if is , or , if is a transition label, or , if is an activity function.(ii) is constructed by one-to-one mapping , which maps to , .(iii).(iv).(v) that with and corresponds to .

In [1], the authors also proved that given any hybrid automaton and , the polynomial hybrid automaton is an approximation of .

We study the relations between generic hybrid automata and their Taylor approximations.

#### 3. The Simulation of a Hybrid Automaton and Its Approximation

The* behavior* is one of the most important concepts in formal methods, which shows a way of analyzing a formal system dynamically. The behavior analysis is also seen as the base of comparing formal systems. Formally, the behavior is composed of traces of sequences of states, which exhibits the system run. We study the relation between hybrid automata by their behaviors.

There are two kinds of hybrid system run, namely, flow and jump, which interleave and interact. Starting from initial condition, the hybrid automaton shows state sequence, which we called* trace*. Similar to the discrete systems, the simplest comparison of hybrid automata is a trace equivalent, for example, whether hybrid automata own the same trace set. However, the trace equivalence is not an accurate way of comparison; it cannot distinguish different behaviors under the branching semantics. The hybrid system is composed of computational processes interacting with physical processes; it rejects the simple comparison which may hide the key information. In contrast, simulation relation checks each state in each trace starting from the initial; it is considered that simulation is more accurate for the complex branching semantics.

*Definition 3. *Let and be hybrid automata with the same event symbols. The binary relation is a simulation of by if the following two conditions hold.(i)For each state , , and being time elapsing, if and , then there exists a state such that and .(ii)For each state , , and , if and , then there exists a state such that and .(iii)For initial state and for state , if , then . We denote is simulated by as for short.

Definition 3 shows a qualitative relation that the hybrid automaton simulates . Because the hybrid systems are so complex that it is not easy to be analyzed directly, it is a common way of computing the reachability of the approximation. Let us define the approximation of a hybrid automaton formally; the following definition is from [1].

*Definition 4. *A hybrid automaton is an approximation of a hybrid automaton if is obtained from by replacing each formula with a formula such that .

The operator maps a formula to its satisfied value set, and it is proved in [1] that the is the approximation of a hybrid automaton .

The Taylor approximation is one of the most useful and applicable approximation of a hybrid automaton. Although the Taylor approximation has been proposed for several years, the relation between the approximation and hybrid automaton is not well studied. It is interesting to check the simulation relation between an automaton and its Taylor approximation. We show this as a theorem.

Theorem 5. *A hybrid automaton is simulated by its Taylor approximation, for example, for a hybrid automaton , .*

*Proof. *Suppose is a hybrid automaton and its Taylor approximation. Let and ; and have relation , for example, ; we prove is a simulation relation.*Case 1* ( that be an event). According to Definition 2, is constructed by a one-to-one mapping from ; for example, , that , , and .*Case 2* ( that be time elapsing). According to Definition 2, that , , and . Then according to Definition 4, we have . Let and be two values that satisfy at moments and separately; then is a time duration; for example, we formally express this as , . Because we have known that , then , ; for example, we get .*Case 3* ( in terms of Definition 2). Then Theorem 5 is proved.

From now on, we know that the Taylor approximation simulates its original hybrid automaton; for example, the behavior of the hybrid automaton is preserved by its Taylor approximation totally. Although there might be “granularity” problems while checking the safety related properties, the approximation provides a very applicable way. Moreover, Theorem 5 could be extended to all types of approximations.

#### 4. Approximate Equivalence Relation

Theorem 5 shows a relation between simulation and approximation. Since approximation of a hybrid automaton is always quantifiable, we can study a quantified simulation relation indirectly.

Two hybrid automata could be almost the same although their formulae may be different; for example, events are same; formula owns the same Taylor expansion regardless of their remainder. We call this relation* Taylor **-related*; is the rank of this relevancy that shows that all formulae are derivable times. We can construct an upper bound in terms of upper bounds of remainders of two Taylor related hybrid automata and then construct a hybrid automaton that simulates both two systems.

Theorem 6. *The Taylor -related hybrid automata are simulated by the same hybrid automaton.*

*Proof. *Suppose with ; and are Taylor -related.

We can construct the Taylor approximation of each hybrid automaton, . According to Theorem 5, . Let be the formulae set of and the set of ; then according to Definition 2, for each and , we have
Because and are Taylor -related, then and with .

Now we construct the hybrid automaton with
is an upper bound of and that and , and .

We prove is an approximation of ; for example, prove that for any formula . We have assumed that is in . Let us begin with the base case where and .

Let be a vector such that ; that is, . Let be Lagrange remainder of ; for example,
According to Definition 2, . By previous analysis, there exists some remainder . Therefore,
which is equivalent to
Since and , the last equation above implies
which is equivalent to
which implies that .

Then let us consider the cases of formulae composition, for example, formulae connected with or/and . Let us consider the inductive step . It holds that . By the inductive hypothesis, and . Hence, . The case of is similar and not shown here.

Then we proved that ; for example, is an approximation of . According to Theorem 5, simulate . Then Theorem 6 is proved.

We call the Taylor approximation of Taylor -related hybrid automata* Taylor related approximation*. It is easy to see that the Taylor related relation is an equivalence, for example, a relation satisfying reflexive, transitive and symmetry.

Theorem 7. *The Taylor related approximation is an approximate equivalence, which is denoted as with being the rank of relevancy.*

Then finally we propose a quantified approximate equivalence.

We can compare two similar hybrid systems by their Taylor approximation, for example, a quantitative comparison that shows the degree of the similarity. Let us study a thermostat that is described in [2]; the temperature of a room is controlled by a thermostat which continuously senses the temperature and turns a heater on and off. When the heater is off, the temperature describes in terms of the function ; when the heater is on, the temperature follows , where and are constants. We can express the thermostat formally in Figure 1.

According to Theorem 5, we can construct its approximation (see Figure 3 in [1]); the thermostat is simulated by its approximation; for example, let the hybrid automaton of thermostat be denoted as and let its approximate be; then . Furthermore, in terms of Theorem 7, it is easy to know that.

#### 5. Conclusion

In this paper, we studied the simulation relation among the hybrid automata and their Taylor approximations and then proposed an approximate equivalence relation. The simulation relation discovers how a Taylor approximation confirms to its original hybrid automaton; meanwhile, the equivalence explores the degree of similarity of similar automata quantitatively. In future, we plan studying the bisimulation of the automata and approximations in two ways, a more accurate approximation theory and metric semantics of hybrid automata.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work is partly supported by the NSF of Guangxi nos. 2011GXNSFA018154, 2012GXNSFGA060003, and 2013GXNSFAA019342, the Science and Technology Foundation of Guangxi no. 10169-1, Guangxi Scientific Research Project no. 201012MS274, GUN Project no. 2012Q017, and the Bagui scholarship project.

#### References

- R. Lanotte and S. Tini, “Taylor approximation for hybrid systems,”
*Information and Computation*, vol. 205, no. 11, pp. 1575–1607, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. Alur, C. Courcoubetis, N. Halbwachs et al., “The algorithmic analysis of hybrid systems,” in
*Theoretical Computer Science*, vol. 138, pp. 3–34, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. A. Henzinger, P.-H. Ho, and H. Wong-toi, “Algorithmic analysis of nonlinear hybrid systems,”
*IEEE Transactions on Automatic Control*, vol. 43, no. 4, pp. 540–554, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. A. Henzinger, “The theory of hybrid automata,”
*Technical Report*UCB/ERL M96/28, EECS Department, University of California, Berkeley, Calif, USA, 1996. View at Google Scholar - R. Gentilini, K. Schneider, and B. Mishra, “Successive abstractions of hybrid automata for monotonic CTL model checking,” in
*Proceedings of the International Symposium on Logical Foundations of Computer Science (LFCS '07)*, pp. 224–240, June 2007. View at Scopus - A. Podelski and S. Wagner, “Model checking of hybrid systems: from reachability towards stability,” in
*Hybrid Systems: Computation and Control*, vol. 3927 of*Lecture Notes in Computer Science*, pp. 507–521, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya, “What's decidable about hybrid automata?”
*Journal of Computer and System Sciences*, vol. 57, no. 1, pp. 94–124, 1998. View at Google Scholar · View at Scopus - B. C. Williams and M. M. Henry,
*Model-based estimation of probabilistic hybrid automata [M.S. thesis]*, Howard University, Washington, DC, USA, 2002. - J. M. B. Braman and R. M. Murray, “Probabilistic safety analysis of sensordriven hybrid automata,”
*Hybrid Systems: Computation and Control*, 2009. View at Google Scholar - A. Edalat and D. Pattinson, “Denotational semantics of hybrid automata,” in
*Proceedings of the Foundations of Software Science and Computation Structure (FoSSaCS '06)*, pp. 231–245, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - R. Alur, T. A. Henzinger, G. Lafferriere, and G. J. Pappas, “Discrete abstractions of hybrid systems,”
*Proceedings of the IEEE*, vol. 88, no. 7, pp. 971–984, 2000. View at Publisher · View at Google Scholar · View at Scopus - T. A. Henzinger and R. Majumdar, “Symbolic model checking for rectangular hybrid systems,” in
*Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems (TACAS '00)*, Lecture Notes in Computer Science, pp. 142–156, Springer, New York, NY, USA, 2000. - A. M. Bayen, E. Cruck, R. M. Bayen, and C. J. Tomlin, “Guaranteed overapproximations of unsafe sets for continuous and hybrid systems: solving the hamilton-jacobi equation using viability techniques,” in
*Hybrid Systems: Computation and Control*, pp. 90–104, Springer, New York, NY, USA, 2002. View at Google Scholar - A. Chutinan and B. H. Krogh,
*Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations*, Springer,, New York, NY, USA, 1999. - A. B. Kurzhanski and P. Varaiya, “On reachability under uncertainty,”
*SIAM Journal on Control and Optimization*, vol. 41, no. 1, pp. 181–216, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Fränzle, “Analysis of hybrid systems: an ounce of realism can save an infinity of states,” in
*Computer Science Logic*, vol. 1683 of*Lecture Notes in Computer Science*, pp. 126–140, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Fränzle, “What will be eventually true of polynomial hybrid automata?” in
*Theoretical Aspects of Computer Software*, vol. 2215 of*Lecture Notes in Computer Science*, pp. 340–359, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet