A closed-form evaluation for Datalog queries with integer (gap)-order constraints
ICDT Selected papers of the 4th international conference on Database theory
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
UPPAAL—a tool suite for automatic verification of real-time systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Proving a Real Time Algorithm for ATM in Coq
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Symbolic Verification with Gap-Order Constraints
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Modelisation of Timed Automata in Coq
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Correctness Proof of the Standardized Algorithm for ABR Conformance
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
| Hi-index | 0.00 |
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.