Assume-guarantee reasoning for hybrid I/O-automata by over-approximation of continuous interaction

Proceedings of the IEEE Conference on Decision and Control

Volumn 1, Issue , 2004, Pages 479-484

  Frehse, Goran ^a   Han, Zhi ^a   Krogh, Bruce ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

ASSUME-GUARANTEE REASONING (AGR); DIGITALLY CONTROLLED SYSTEMS; HYBRID AUTOMATA; HYBRID LABELED TRANSITION SYSTEMS;

AUTOMATION;

EID: 14344264412     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1428676     Document Type: Conference Paper

References (12)

1. N.A. Lynch, R. Segala, and F. Vaandrager, "Hybrid I/O automata," Information and Computation, vol. 185, no. l, pp. 105-157, 2003.
2. T. Henzinger, "The theory of hybrid automata," in Proc. of the 11th Annual IEEE Symposium on Logic in Computer Science (UCS '96), New Brunswick, New Jersey, 1996, pp. 278-292.
3. O. Grumberg and D. E. Long, "Model checking and modular verification," in CONCUR, ser. Lecture Notes in Computer Science, J. C. M. Baeten and J. F. Groote, Eds., vol. 527. Springer, 1991.
4. R. Alur and T. A. Henzinger, "Modularity for timed and hybrid systems," in Proceedings of the Eighth International Conference on Concurrency Theory (CONCUR), ser. LNCS, vol. 1243. Springer, 1997, pp. 74-88.
5. T. A. Henzinger, M. Minea, and V. Prabhu, "Assume-guarantee reasoning for hierarchical hybrid systems," in HSCC '01: 4th International Workshop on Hybrid Systems: Computation and Control, ser. Lecture Notes in Computer Science, vol. 2034, Springer, 2001, pp. 275-290.
6. T. A. Henzinger, S. Qadeer, S. K. Rajamani, and S. Tasiran, "An assume-guarantee rule for checking simulation," ACM Trans. Program. Lang. Syst., vol. 24, no. 1, pp. 51-64, 2002.
7. G. Frehse, "Compositional verification of hybrid systems using simulation relations," Ph.D. dissertation, Radbout Universiteit Nijmegen, Dec. 2004.
8. R. Alur, C. Courcoubetis, T. A. Henzinger, and P.-H. Ho, "Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems," in Workshop on Theory of Hybrid Systems, ser. LNCS, R. L. Grossman, A. Nerose, A. Ravn, and H. Rischel, Eds., vol. 736. Springer-Verlag, 1993, pp. 209-229.
9. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine, "The algorithmic analysis of hybrid systems," Theoretical Computer Science, vol. 138, no. 1, pp. 3-34, 1995.
10. G. Frehse, "Compositional verification of hybrid systems with discrete interaction using simulation relations," in Proc. CACSD'04, Taipei, 2004.
11. M. R. Henzinger, T. A. Henzinger, and P. W. Kopke, "Computing simulations on finite and infinite graphs," in IEEE Symposium on Foundations of Computer Science, 1995, pp. 453-462.
12. R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill, "Possibly not closed convex polyhedra and the Parma Polyhedra Library," in Static Analysis: Proc. of the 9th Int. Symposium, ser. LNCS, M. V. Hermenegildo and G. Puebla, Eds., vol. 2477. Madrid, Spain: Springer-Verlag, 2002, pp. 213-229.