. Finalement, Ces techniques occupent une place bien d eaenie dans la cha^ ne de conception de protocoles. Elles sont bas ees sur des mod eles math ematiques probabilistes du syst eme a v eriaeer et consistent a calculer certaines mesures importantes e.g, le temps moyen d'ex ecution d'une t^ achee, BIBLIOGRAPHIE, vol.159

A. Bibliographie-Ëabë-telelogic, M. E. Sdt-reference, M. Asarin, A. Bozga, O. Kerbrat et al., Data Structures for the Veriaecation of Timed Automata A Theory of Timed Automata GOAL: Observing SDL Behaviors with GEODE On the Discretization of Delays in Timed Automata and Digital Circuits Automatic Generation of Invariants and Intermediate Assertions Symbolic Model Checking : 10 20 states and beyond An Introduction to ESTELLE: A Speciaecation Language for Distributed Systems, Proceedings of HART'97 ëALH95ë B. Algayres, Y. Lejeune, and F. Hugonnet Proceedings of SDL FORUM'95 Proceedings of CONCUR'98 Compilers: Principles, Techniques and Tools Proceedings of LICS'90 Proceedings of the FORTEèPSTV'98 Dams, L. Holenderski, and N. Sidorova. Model Checking SDL with Spin Proceedings of TACAS, pp.1-34183, 1986.

+. , M. Bozga, C. Daws, O. Maler, A. Olivero et al., Kronos: a Model-Checking Tool for Real-Time Systems, Proceedings of CAV'98, pp.546-549, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00374788

+. , A. Bouajjani, J. Cl, S. Fernandez, C. Graf et al., Safety for Branching Time Semantics, Proceedings of ICALP'91, 1991.

+. , M. Bozga, J. Cl, L. Fernandez, C. Ghirvu et al., Veriaecation and Test Generation for the SSCOP Protocol State Space Reduction based on Live Variables Analysis, Proceedings of SAS'99, 1998.

I. Venice, M. Bozga, J. Cl, A. Fernandez, L. Kerbrat et al., Protocol Veriaecation with the Aldebaran Toolset Software Tools for Technology Transfer, 111+22:166í183 Automatic Generation of Invariants. Formal Methods in System Design, 15511:75í92 Deductive Veriaecation of Parameterized Fault Tolerant Systems: a Case Study Computing Abstractions of Inaenite State Systems Compositionally and Automatically Eaecient Timed Reachability Analysis using Clock Diaeerence Diagrams Process Algebra Semantics of 'SDL, Proceedings of ICTL'97 Proceedings of CAV'98 Proceedings of CAV'99 Proceedings of 2nd Workshop on ACP, pp.319-331, 1995.

M. Bozga and O. Maler, On the Representation of Probabilities over Structured Domains, Proceedings of CAV'99 ëBMPY97ë M. Bozga, O. Maler, A. Pnueli, and S. Yovine. Some Progress in the Symbolic Veriaecation of Timed Automata Proceedings of CAV'97, 1999.
DOI : 10.1007/3-540-48683-6_24

URL : https://hal.archives-ouvertes.fr/hal-00369366

I. M. Haifa, O. Bozga, S. Maler, and . Tripakis, Modeling and Veriaecation of the STARI Chip Using Timed Automata Discrete Time Process Algebra and the Semantics of SDL, Proceedings of CHARM E99, pp.125-141, 1997.

F. Bourdoncle, K. S. Brace, R. L. Rudell, R. E. Bryant, R. E. Bryant et al., Ecole Polytechnique, 1992. ëBoz96ë M. Bozga. V eriaecation formelles de syst emes distribu es et diagrammes de d ecision multivalu es Master's thesis Eaecient Implementation of a BDD Package A Theory for the Derivation of Tests Graph Based Algorithms for Boolean Function Manipulation Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams, Proceedings of 27th ACMèIEEE Design Automation Conference Proceedings of PSTV'88 ëBro91ë M. Broy. Towards a Formal Foundation of the Speciaecation and Description Language SDL. Formal Aspects on Computing ëBST97ë S. Bornot, J. Sifakis, and S. Tripakis. Modeling Urgency in Timed Systems. In International Symposium: Compositionality -The Signiaecant Diaeerence Holstein, pp.40-45, 1986.

O. Coudert, C. Berthet, J. C. Madre, E. M. Clarke, E. A. Emerson et al., Automatic Veriaecation Methods for Finite State Systems Grenoble, Francee Automatic Veriaecation of Finite State Concurrent Systems Using Temporal Logic Speciaecations: A Practical Approach Automatically Closing Open Reactive Systems Automatic Discovery of Linear Restraints Among Variables of a Program ëCor94ë Digital Equipment Corporation. TiGeR Library Manual Reference, 1994. ëCou78ë P. Cousot. M ethodes it eratives de construction et d'approximations de points aexes d'op erateurs monotones sur un treillis. Analyse s emantique des programmes s equentiels, Veriaecation of Synchronous Sequential Machines based on Symbolic Execution Proceedings of 10th ACM Symposium on Programming Languages Proceedings of ACM SIGPLAN on Programming Language Design and Implementation Proceedings of ACM Symposium on Principles of Programming Languages ëCR79ë E. Chang and R. Roberts. An Improved Algorithm for Decentralized Extrema- Finding in Circular Conaegurations of Processes. Communications of the ACM ëCS93ë R. Cleaveland and B. Steaeen. A Linear Time Model Checking Algorithm for the Alternation Free Modal Mu-Calculus. Formal Methods in System Design, pp.345-357, 1978.

T. In, B. Margaria, M. Steaeen, P. Vardi, M. Wolper et al., Memory Eaecient Algorithms for the Veriaecation of Temporal Properties, Proceedings of TACAS'96 Proceedings of CAV'90, pp.329-348, 1990.

C. Daws, M ethodes d'analyse de syst emes temporis es : de la th eorie a la pratique, 1998.

M. B. Dwyer, J. Hatcliae, E. A. Emerson, C. Lei, H. Fleischhack et al., Slicing Software for Model Construction Timing Assumptions and Veriaecation of Finite-State Concurrent Systems In International Workshop on Automatic Veriaecation Methods for Finite State Systems Grenoble, Francee Eaecient Model Checking in Fragments of the Propositional Mu-Calculus ALDEBARAN : un syst eme de v eriaecation par r eduction de processus communicants A Compositional Petri Net Semantics for SDL CADP: A Protocol Validation and Veriaecation Toolbox, Proceedings of ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation PEPM'999 Proceedings of LICS'86 ëEM85ë E. Ehrig and B. Mahr. Fundamentals of Algebraic Speciaecations ëFer88ë J.Cl. Fernandez Proceedings of ATPN'98 Application and Theory of Petri Netss Lisboa , Portugall Proceedings of CAV'96 ëOn the Fly" Veriaecation of Finite Transition Systems. Formal Methods in System Design, 1992. ëFJJV97ë J.Cl. Fernandez, C. Jard, T. J eron, and C. Viho. An Experiment in Automatic Generation of Test Suites for Protocols with Veriaecation Technology ëFKM93ë J.Cl. Fernandez, A. Kerbrat, and L. Mounier. Symbolic Equivalence Checking Proceedings of CAV'93 ëFM90ë J.Cl. Fernandez and L. Mounier. Verifying Bisimulations ëOn the Fly, pp.144-164, 1985.

I. J. Quemada, J. Manas, E. Vv, . Madrid, . Spainn et al., Veriaecation of Behavioural Equivalences and Preorders Finding the Optimal Variable Ordering for Binary Decision Diagrams Compilation et v eriaecation de programmes LOTOS Compilation of LOTOS Abstract Data Types OPENèCçSAR: An Open Software Architecture for Veriaecation, Simulation, and Testing A Tool for Symbolic Program Veriaecation and Abstraction Tele Danmark Research, 1991. ëGod96ë P. Godefroid. Partial-Order Methods for the Veriaecation of Concurrent Systems -An Approach to the State Explosion Problem The Netherlands, Proceedings of FORTEèPSTV'90 Proceedings of CAV'91 ëGar89bë H. Garavel Proceedings of FORTEèPSTV'89 Vancouver, Canadaa, pages 147í162. North Holland Proceedings of TACAS'98 Proceedings of CAV'93 ëGM96ë H. Garavel and L. Mounier. Speciaecation and Veriaecation of Distributed Leader Election Algorithms for Unidirectional Ring Networks. Science of Computer Programming, 2991í22:171í197 ëGod91ë J.C. Godskesen. An Operational Semantic Model for Basic SDL ëGS90aë H. Garavel and J. Sifakis. Compilation and Veriaecation of LOTOS Speciaecations Proceedings of PSTV'90 Proceedings of CAV'90 Rutgers ëGV90ë J.F. Groote and F. Vaandrager. An Eaecient Algorithm for Branching Bisimulation and Stuttering Equivalence, pp.710-713, 1989.

P. Godefroid, P. Wolper-hulgaard, S. Burns, T. Amon, G. Boriello et al., Practical Application of an Eaecient Time Separation Algorithm Eaecient Veriaecation wiyh BDDs using Implicitly Conjoined Invariants Symbolic Model Checking for Real-Time Systems Information and Computation, 111122, 1994. ëHoa69ë C.A.R. Hoare. An Axiomatic Basis of Computer Programming Design and Validation of Computer Protocols International Organization for Standardization | Information Processing Systems | Open Systems Interconnection, Gen eve, 1988. ëISO89ë ISOèIEC. Estelle | A Formal Description Technique based on an Extended State Transition Model International Organization for Standardization | Information Processing Systems | Open Systems Interconnection , Gen eve, 1989. ëISO92ë ISOèIEC. Open Systems Interconnection Conformance Testing Methodology and Framework í Part 1: General Concept í Part 2:Abstract Test Suite Speciaecation í Part 3: The Tree and Tabular Combined Notation TTCNN International Organization for Standardization | Information Processing Systems | Open Systems Interconnection, Gen eve, 1992. 166 BIBLIOGRAPHIE ëIT94aë ITU-T. Annex F.2 to Recommendation Z.100. Speciaecation and Description Language SDLL -SDL Formal Deaenition: Static Semantics Gen eve, 1994. ëIT94bë ITU-T. Annex F.3 to Recommendation Z.100. Speciaecation and Description Language SDLL -SDL Formal Deaenition: Dynamic Semantics ATM Adaptation Layer -Service Speciaec Connection Oriented Protocol SSCOPP Gen eve, 1994. ëIT94dë ITU-T. Recommendation Z.100. Speciaecation and Description Language SDLL On-line Model-Checking for Finite Linear Temporal Logic Bounded Memory Algorithms for Veriaecation On-theaey, Using Partial Orders for the Eaecient Veriaecation of Deadlock Freedom and Safety Properties Proceedings of CAV'91 Proceedings of ICCAD'93 Proceedings of CAV'93 Proceedings of ICALP'92 ëHoa78ë C.A.R. Hoare. Communicating Sequential Processes. Communications of the ACM ëHoa84ë C.A.R. Hoare. Communicating Sequential Processes ëIT94eë ITU-T. Recommendation Z.120. Message Sequence Charts International Workshop on Automatic Veriaecation Methods for Finite State Systems Proceedings of CAV'91 Aalbord Proceedings of CAV'99 ACM Symposium on Principles of Programming Languages Methods and Methodology for Incremental Test Generation from SDL. In R. Dssouli, G. Bochmann, and Y. Lahav Proceedings of SDL FORUM'99, pp.275-285, 1969.

+. , R. Kurshan, V. Levin, M. Minea, D. Peled et al., Static Partial Order Reduction, Proceedings of TACAS'98, pp.345-357, 1998.

J. P. Krimm, L. Mounier, and L. Lamport, The Netherlandss Interconnecting the ObjectGEODE and CADP Toolsets Finite State Processes and Three Problems of EquivalenceSometimí e is Sometimes "Not Never". On the Temporal Logic of Programs Distributed Systems í Towards a Formal Approach An Introduction to ET-LOTOS for the Description of Time-Sensitive Systems UPPAAL: Status & Developments, Compositional State Space Generation from LO- TOS Programs Proceedings of TACAS'97 Enschede Proceedings of SDL FORUM'97 Proceedings of ACM Symposium on Principles of Programming Languages Information Processing ëLon93ë D.E. Long. Model Checking, Abstraction and Compositional Veriaecation Proceedings of CAV'97, pp.475-490, 1977.

R. Mateescu and K. L. Mcmillan, V eriaecation des propri et es temporelles des programmes parall eles Symbolic Model Checking: an Approach to the State Explosion Problem, ëMil80ë R. Milner. A Calculus of Communication Systems, 1980.

L. Mounier, A. Manna, O. Pnueli, A. Maler, R. Pnueli et al., The Temporal Logic of Reactive and Concurrent Systems Timing Analysis of Asynchronous Circuits using Timed Automata Advanced Compiler Design Implementation Back and Forth Bisimulations ATP: An Algebra for Timed Processes Action versus State based Logics for Transition Systems Formal Veriaecation for Fault-Tolerant Architectures: Prolegomena to the Design of PVS Combining Partial Order Reductions with On-The-Fly Model- Checking, Proceedings of CHARM E95 ëMuc97ë S. Muchnick Proceedings of the IFIP Working Conference on Programming Concepts and Methods Proceedings Ecole de Printemps on Semantics of Concurrency, number 469 ëPar81ë D. Park. Concurrency and Automata on Inaenite Sequences Proceedings of CAV'94 ëPha94ë M. Phalippou. Test Sequence Generation using Estelle or SDL Structure Information . In D. Hogrefe and S. Leue Proceedings of FORTEèPSTV'94, pp.168-95, 1981.

S. Berne, A. Pnueli, R. Paige, and R. E. Tarjan, In Transition From Global To Modular Temporal Reasoning About Programs. Logics and Models for Concurrent Systems Three Partition Reaenement Algorithms Speciaecation and Veriaecation of Concurrent Programs in CESAR, International Symposium on Programming ëRBP + 91ë J. Rumbaugh, M. Blaha, W. Premerlani, F. Edyy, and W. Lorensen. Object- Oriented Modeling and Design, pp.405-420973, 1982.

C. Rodriguez, Validation of SDL Speciaecations via Abstractions Master's thesis, Ecole Politechnique de Tunisie, 1999. ëSig99ë M. Sighireanu. Contribution at the Deaenition and Implementation of E-LOTOS, Sp eciaecation et validation de syst emes en XESAR ëSomë F. Somenzi. CUDD Decision Diagram Package. Colorado University. ëST87ë R. Saracco and P.A.J. Tilanus. CCITT SDL: Overview of the Language and its Applications. Computer Networks and ISDN Systems ëTB97ë S. Tasiran and R. Brayton. STARI: A Case Study in Compositional and Hierarchical Timing Veriaecation Proceedings of CAV'97, 1987.

I. Haifa, C. Amsterdam-r9029, C. Amsterdam, T. Netherlands, R. J. Van-glabbeek et al., The Netherlands, 1994. ëTre92ë J. Tretmans. A Formal Approcah to Conformance Testing The Netherlands, 1992. ëTri98ë S. Tripakis. L'Analyse Formelle de Syst emes Temporis es en Pratique ëVal92ë A. Valmari. A Stubborn Attack on State Explosion Formal Methods in System Design, 1992. ëVerë Verilog. ObjectGEODE Reference Manual. http:èèwww.verilogusa.comè. ëvG90ë R.J. van Glabbeek. The Linear Time í Branching Time Spectrum Branching-Time and Abstraction in Bisimulation Semantics A Linear Algorithm for Solving Fixed Point Equations on Transitions Systems A Linear Local Model Checking Algorithm for CTL, Survey of Program Slicing Techniques Proceedings of 17th Colloquium on Trees in Algebra and Programming Rennes Proceedings of CONCUR'93 ëWin90ë G. Winskel. Compositional Checking of Validity on Finite State Processes Workshop on Theories of Communication ëYov97ë S. Yovine. KRONOS: A Veriaecation Tool for Real-Time Systems. Software Tools for Technology Transfer, pp.13322123-133, 1989.

A. Si and . Enote-un, ensemble d'actions et a 2 A, la syntaxe des formules de -calcul est la suivante : ::= tt j X j : j ^ j ëaëë j X

. La-complexit-e-des-algorithmes-d, evaluation des formules de -calcul d epend de la profondeur d'alternation de points aexes. Intuitivement, il s'agit de la longueur maximale des cha^ nes de sous-formules, mutuellement r ecursives, avec des point aexes diae erents. Par exemple, les formules X:X ^ Y:haiY et X::Y:X ^ Y ont la profondeur d'alternation 1