Synthesis and verification of constraints in the PGM protocol

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2805, Issue , 2003, Pages 264-281

  Boyer, Marc ^a   Sighireanu, Mihaela ^b  

^a IRIT   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Constraint synthesis; Finite and timed model checking; Parameterized verification; PGM protocol; Real time multicast protocol

Indexed keywords

FORMAL METHODS; MULTICASTING; RELIABILITY; SYNTHESIS (CHEMICAL);

AUTOMATIC SYNTHESIS; MODEL CHECKING TOOLS; NON-LINEAR CONSTRAINTS; PARAMETERIZED MODEL; PARAMETERIZED VERIFICATIONS; REAL-TIME MULTICAST; RELIABILITY PROPERTIES; TIMED MODEL CHECKING;

MODEL CHECKING;

EID: 35248833821     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45236-2_16     Document Type: Article

References (18)

1. A. Annichini, E. Asarin, and A. Bouajjani. Symbolic techniques for parametric reasoning about counter and clock systems. In E.A. Emerson and A.P. Sistla, editors, Proceedings of the 12th CAV, volume 1855 of LNCS, pages 419-434. Springer Verlag, July 2000.
2. R. Alur, T.A. Henzinger, and M.Y. Vardi. Parametric real-time reasoning. In ACM Symposium on Theory of Computing, pages 592-601, 1993.
3. B. Bérard, P. Bouyer, and A. Petit. Analysing the pgm protocol with uppaal. In P. Pettersson and W. Yi, editors, Proceedings of the 2nd Workshop RT-TOOLS, Copenhagen (Denmark), August 2002.
4. A. Bouajjani, A. Collomb-Annichini, Y. Lackneck, and M. Sighireanu. Analysing fair parametric extended automata analysis. In Proceedings of SAS'01, LNCS. Springer Verlag, July 2001.
5. A. Bouajjani, A. Collomb-Annichini, and M. Sighireanu. Trex: A tool for reachability analysis of complex systems. In Proceedings of CAV'01, LNCS. Springer Verlag, 2001.
6. M. Bozga, J.-C. Fernandez, L. Girvu, S. Graf, J.-P. Krimm, and L. Mounier. If: A validation environment for times asynchronous systems. In E.A. Emerson and A.P. Sistla, editors, Proceedings of the 12th CAV, volume 1855 of LNCS, pages 543-547. Springer Verlag, July 2000.
7. B. Boigelot and L. Latour. ADVANCE Project Deliverable Report, chapter Verifying PGM with infinitely many packets. LIAFA, 2002.
8. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, University of Liège, 1998.
9. M. Boyer. On modeling and verifying the pgm protocol. Technical report, LIAFA, 2002.
10. T. Bultan. Automated symbolic analysis of reactive systems. PhD thesis, University of Maryland, 1998.
11. E. A. Emerson and C-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proceedings of the 1st LICS, pages 267-278, 1986.
12. J. Esparza and M. Maidl. ADVANCE Project Deliverable Report, chapter Verifying PGM with infinitely many topologies. LIAFA, 2002.
13. J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. Cadp (cæsar/aldebaran development package): A protocol validation and verification toolbox. In R. Alur and T.A. Henzinger, editors, Proceedings of the 8th CAV, volume 1102 of LNCS, pages 437-440. Springer Verlag, August 1996.
14. T. Hune, J. Romijn, M. Stoelinga, and F. Vaandrager. Linear parametric model checking of timed automata. In Proceedings of TACAS'01, 2001.
15. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
16. R. Mateescu and M. Sighireanu. Efficient on-the-fly model-checking for regular alternation-free mu-calculus. In Proceedings of the 5th International Workshop on Formal Methods for Industrial Critical Systems FMICS'2000 (Berlin, Germany), April 2000.
17. P. Pettersson and K.G. Larsen. UPPAAL2k. Bulletin of the European Association for Theoretical Computer Science, 70:40-44, February 2000.
18. Tony Speakman, Dino Farinacci, Jon Crowcroft, Jim Gemmell, Steven Lin, Dan Leshchiner, Michael Luby, Alex Tweedly, Nidhi Bhaskar, Richard Edmonstone, Todd Montgomery, Luigi Rizzo, Rajitha Sumanasekera, and Lorenzo Vicisano. PGM reliable transport protocol specification. RFC 3208, IETF, Decembre 2001. 111 pages.