Abstract
The ABR conformance protocol is a real-time program developed at France Telecom, that controls dataflow rates on ATM networks. A crucial part of this protocol is the dynamical computation of the expected rate of data cell emission. We present here a modelization of the corresponding program, using parametric timed automata. In this framework, a fundamental property of the service provided by the protocol to the user is expressed as a reachability problem. The tool HyTech is then used for computing the set of reachable states of the model, and automatically proving the property. This case study gives additional evidence of the importance of the model of parametric timed automata and the practical usefulness of symbolic analysis tools.
Chapter PDF
Similar content being viewed by others
References
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 138:3, 1995, pp. 3–34.
R. Alur, C. Courcoubetis, T.A. Henzinger and P.-H. Ho. “Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems”. Hybrid Systems I, LNCS 736, 1993, pp. 209–229.
R. Alur and D. Dill. “Automata for Modeling Real-Time Systems”. Proc. 17th ICALP, LNCS 443, 1990, pp. 322–335.
R. Alur, T.A. Henzinger, M. Vardi. “Parametric real-time reasoning”. Proc. 25th Annual ACM Symp. on Theory of Computing (STOC), 1993, pp. 592–601.
J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson and W. Yi. “UPPAAL-a Tool Suite for Automatic Verification of Real-Time Systems”. Hybrid Systems III, LNCS 1066, 1996, pp. 232–243.
B. Bèrard and L. Fribourg. “Automated verification of a parametric realtime program: the ABR conformance protocol”. Technical Report LSV-98-12, CNRS & Ecole Normale Supèrieure de Cachan, Dec. 1998 (http://www.lsv.ens-cachan.fr/Publis/).
B. Bèrard and L. Fribourg. “Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic”. Technical Report LSV-99-3, CNRS & Ecole Normale Supèrieure de Cachan, March 1999 (http://www.lsv.ens-cachan.fr/Publis/).
C. Daws, A. Olivero, S. Tripakis and S. Yovine. “The Tool KRONOS”. Hybrid Systems III, LNCS 1066, 1996, pp. 208–219.
P. Felix et al.. “Comprèhension de l’ètude de cas ABR”. Internal Note, LaBRI, University of Bordeaux, France, 1997.
L. Fribourg. “A Closed-Form Evaluation for Extended Timed Automata”. Technical Report LSV-98-2, CNRS & Ecole Normale Supèrieure de Cachan, March 1998. (http://www.lsv.ens-cachan.fr/Publis/)
L. Fribourg and J. Richardson. “Symbolic Verification with Gap-Order Constraints”. Proc. 6th Intl. Workshop on Logic Program Synthesis and Transformation (LOPSTR), LNCS 1207, 1996, pp. 20–37.
T. Henzinger, P.-H. Ho and H. Wong-Toi. “A User Guide to HYTECH”. Proc. TACAS’95, LNCS 1019, 1995, pp. 41–71.
J.F. Monin. “Proving a real time algorithm for ATM in Coq”. Types for Proofs and Programs, LNCS 1512, 1998, pp. 277–293.
J.-F. Monin and F. Klay. “Formal specification and correction of I.371.1 algorithm for ABR conformance”. Internal Report NT DTL/MSV/003, CNET, 1997.
X. Nicollin, A. Olivero, J. Sifakis and S. Yovine. “An Approach to the Description and Analysis of Hybrid Systems”. Hybrid Systems I, LNCS 736, 1993, pp. 149–178.
P.Z. Revesz. “A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints”, Theoretical Computer Science, 1993, vol. 116, pp. 117–149.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béerard, B., Fribourg, L. (1999). Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol. In: Halbwachs, N., Peled, D. (eds) Computer Aided Verification. CAV 1999. Lecture Notes in Computer Science, vol 1633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48683-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-48683-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66202-0
Online ISBN: 978-3-540-48683-1
eBook Packages: Springer Book Archive