. Si-le-premier-cas-est-vrai, Alg ebre de processus et synchronisation, Theoretical Computer Science, vol.30, 1984.

A. R. Alur, C. Courcoubetis, and D. Dill, Model-checking for real-time systems, Proceedings of the fth annual IEEE symposium on Logics In Computer Science, p.4144425, 1990.

A. R. Alur and D. Dill, Automata for modeling real-time systems, Proceedings of ICALP '90, p.3222335, 1990.
DOI : 10.1007/BFb0032042

A. R. Alur, T. Feder, and T. Henzinger, The beneets of relaxing punctuality, Proceedings of the tenth annual symposium on Principles Of Distributed Computing, p.1399152, 1991.

A. R. Alur and T. Henzinger, A really temporal logic, Proceedings of the 30 th Symposium on Foundations of Computer Science, p.1644169, 1989.

A. R. Alur, T. Henzinger, J. W. De-bakker, C. Huizing, W. P. D-e-r-o-e-v-er et al., Logics and models of real time: a survey Proceedings of REX workshop Real-time: theory in practice, LNCS, vol.600, 1991.

A. M. Abadi and L. Lamport, The existence of reenement mappings. SRC 29, Digital Equipement Corporation, 1988.

A. R. Alur, Techniques for automatic veriication of real-time systems. T h ese, 1991.

B. J. Baeten and J. A. Bergstra, Real time process algebra Rapport de recherche CS-R9053, 1990.

B. G. Berry and L. Cosserat, The ESTEREL synchronous programming language and its mathematical semantics, Proceedings CMU Seminar on Concurrency, p.3899448, 1984.
DOI : 10.1007/3-540-15670-4_19
URL : https://hal.archives-ouvertes.fr/inria-00076230

J. B. Bcd-+-900, E. M. Burch, D. Clarke, L. J. Dill, K. L. Hwang et al., Symbolic model checking: 10 20 states and beyond, Proceedings of LICS '90, p.4288439, 1990.

B. G. Berry, P. Couronn-e-e-t, and G. G-o-n-thier, Programmation synchrone des syst emes r eactifs : le langage Esterel, Technique et Science Informatiques, vol.4, p.3055316, 1987.

B. E. Badouel and P. Darondeau, A note on guarded recursion, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00075309

A. Bfg-+-911, J. Bouajjani, S. Fernandez, C. Graf, J. Rodriguez et al., Safety for branching time semantics, Monien et M. Rodr guez Artalejo, editeurs Proceedings of ICALP '91, p.76692, 1991.

B. A. Bouajjani, J. Fernandez, and N. Halbwachs, On the veriication of safety properties . Rapport technique SPECTRE L12, LGI-IMAG, 1990.

B. S. Brookes, C. A. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes, Journal of the ACM, vol.31, issue.3, p.5600599, 1984.
DOI : 10.1145/828.833

B. B. Bloom, S. Istrail, and A. R. Meyer, Bisimulation can't be traced: preliminary report, Conference r ecords of the 15 th ACM symposium on Principles Of Programming Languages, p.2299239, 1988.

B. J. Bergstra and J. W. Klop, Algebra of Communicating Processes Rapport de recherche CS-R8420, 1984.

B. J. Bergstra, J. W. Klop, M. Hazewinkel, J. K. Lenstra, and L. G. Meertens, Process algebra: speciication and veriication in bisimulation semantics, Proceedings of the CWI symposium Mathematics and Computer Science I I CWI Monograph 4, p.61194, 1986.

B. H. Barringer, R. Kuiper, and A. Pnueli, A really abstract concurrent model and its temporal logic, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '86, p.1733183, 1986.
DOI : 10.1145/512644.512660

B. T. Bolognesi, F. L. Parker, and G. Rose, LOTOS-like process algebras with urgent or timed interactions, Proceedings of the fourth international conference o n F ormal Description Techniques FORTE. North-Holland, 1991.
DOI : 10.1016/B978-0-444-89402-1.50027-8

R. Bry866 and . Bryant, Graph-based algorithms for boolean function manipulation, IEEE Transactions on Computers, issue.8, 1986.

C. O. Coudert, C. Berthet, and J. Madre, Veriication of synchronous sequential machines based on symbolic execution, Sifakis, editeur Proceedings of the international workshop on Automatic Veriication Methods for Finite State Systems, 1989.

C. E. Clarke and E. A. Emerson, Design and synthesis of synchronization skeletons using branching-time temporal logic, Proceedings of workshop on Logic of Programs, 1981.

C. E. Clarke, E. A. Emerson, and A. P. Sistla, Automatic veriication of nite-state concurrent systems using temporal-logic speciications, ACM Transactions on Programming Languages and Systems, vol.8, 1986.

C. P. Caspi, N. Halbwachs, D. Pilaud, and J. Plaice, Lustre: a declarative language for programming synchronous systems, 14 th symposium on Principles Of Programming Languages, 1987.

C. E. Clarke, D. E. Long, and K. L. Mcmillan, Compositional model checking, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 1989.
DOI : 10.1109/LICS.1989.39190

C. P. Couronn-e, J. , J. Plaice, and J. Saint, The Lustre-Esterel portable format version oc3, 1990.

C. R. Cleaveland, J. G. Parrow, and B. Steeen, The concurrency workbench, Proceedings of the international workshop on Automatic Veriication Methods for Finite State Systems, 1989.
DOI : 10.1007/3-540-52148-8_3

C. R. Cleaveland and B. Steeen, A linear-time model checking algorithm for the alternation-free modal -calculus, Proceedings of the 3 rd workshop on Computer-Aided V eriication, 1991.

C. C. Courcoubetis, M. Vardi, P. Olper, and M. Yannakakis, Memory eecient algorithms for the veriication of temporal properties, Proceedings of the 2 nd workshop on Computer-Aided Veriication, 1990.

D. J. Davies, S. Schneider, and G. , An introduction to Timed CSP Rapport de recherche PRG-75, 1989.

E. E. Emerson and E. M. Clarke, Characterizing correctness properties of parallel programs as xpoints, Proceedings of ICALP '80, p.1699181, 1980.

E. E. Emerson and E. M. Clarke, Using branching time temporal logic to synthesize synchronization skeletons, Science of Computer Programming, vol.2, issue.3, p.2411266, 1982.
DOI : 10.1016/0167-6423(83)90017-5

E. E. Emerson and J. Halpern, ???Sometimes??? and ???not never??? revisited: on branching versus linear time temporal logic, Journal of the ACM, vol.33, issue.1, p.1511178, 1986.
DOI : 10.1145/4904.4999

E. E. Emerson and C. L. Lei, EEcient model checking in fragments of the propositional -calculus, Proceedings of LICS '86, 1986.

E. A. Eme911, J. W. Emerson, C. De-bakker, W. P. Huizing, G. D-e-r-o-e-v-er et al., Real time and the -calculus Proceedings of REX workshop Real-time: theory in practice, LNCS, vol.600, 1991.

E. E. Emerson, A. Mok, A. P. Sistla, and J. Srinivasan, Quantitative temporal reasoning, Sifakis, editeur Proceedings of the international workshop on Automatic Veriication Methods for Finite State Systems, 1989.

J. Fer888 and . Fernandez, Ald ebaran, v eriication de processus communicants. T h ese, 1988.

H. Gar899 and . Garavel, Compilation et v eriication de programmes LOTOS. T h ese, 1989.

J. Gro899 and . Groote, Transition system speciication with negative premisses Rapport de recherche CS-R8950, 1989.

G. S. Graf, B. Steeen-dans, R. P. Kurshan, and E. M. Clarke, Compositional minimization of nite state processes, Proceedings of the 2 nd workshop on Computer-Aided V eriication, 1990.

H. Han911 and . Hansson, Time and probability in formal design of distributed systems. T h ese, 1991.

D. Har877 and . Harel, Statecharts : a visual approach to complex systems, Science of Computer Programming, vol.883, p.2311275, 1987.

H. H. Hansson and B. Jonsson, A Calculus for Communicating Systems with time and probabilitiesDans Proceedings of IEEE RTSS, 1990.

H. U. Holmer, K. Larsen, and W. Yi, Deciding properties of regular real timed processes, Proceedings of the 3 rd workshop on Computer-Aided V eriication, 1991.
DOI : 10.1007/3-540-55179-4_41

H. T. Henzinger, Z. Manna, and A. Pnueli, Temporal proof methodologies for real-time systems, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, p.3533366, 1991.
DOI : 10.1145/99583.99629

H. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic model-checking for realtime systems, Proceedings of LICS '92, 1992.

H. M. Hennessy and T. Regan, A Process Algebra for Timed Systems, Information and Computation, vol.117, issue.2, 1991.
DOI : 10.1006/inco.1995.1041
URL : http://doi.org/10.1006/inco.1995.1041

I. Iso88aa and . Estelle, A F ormal Description Technique based on an extended state transition model. I n ternational Standard 9074, International Organization for Standardization | Information Processing Systems | Open Systems Interconnection, 1988.

I. Iso88bb and . Lotos, A F ormal Description Technique based on the temporal ordering of observational behaviour. I n ternational Standard 8807, International Organization for Standardization | Information Processing Systems | Open Systems Interconnection, 1988.

J. C. Jard and T. J. Eron, On-line model-checking for nite linear temporal logic speciication, Sifakis, editeur Proceedings of the international workshop on Automatic Veriication Methods for Finite State Systems, 1989.
DOI : 10.1007/3-540-52148-8_16
URL : https://hal.inria.fr/inria-00075517/document

J. C. Jard, T. J. Eron-dans, and K. G. Larsen, Bounded-memory algorithms for veriication on-the--y, Proceedings of the 3 rd workshop on Computer-Aided V eriication, 1991.

A. S. Klu911 and . Klusener, Completeness in real time process algebra Rapport de recherche CS-R9106, 1991.

D. Koz833 and . Kozen, Results on the propositional -calculus, Theoretical Computer Science, vol.27, 1983.

L. Lam833, R. E. Lamport-dans, and . Mason, What good is temporal logic?, Information Processing 83: proceedings of the 9 th IFIP World Computer Congress, p.6577668, 1983.

L. P. Guernic, A. Benveniste, P. Bournal, and T. Gauthier, Signal: a data ow oriented language for signal processing, 1985.

G. Led911 and . Leduc, On the design and properties of TLOTOS, 1991.

F. Mar900 and . Maraninchi, Argos : un langage graphique pour la conception, la description et la validation des syst emes r eactifs. T h ese, 1990.

M. P. Merlin and D. J. Farber, Recoverability of Communication Protocols--Implications of a Theoretical Study, IEEE Transactions on Communications, vol.24, issue.9, p.249, 1976.
DOI : 10.1109/TCOM.1976.1093424

R. Mil800 and . Milner, A Calculus of Communicating Systems, LNCS 92, 1980.

R. Mil833 and . Milner, Calculi for synchrony and asynchrony, Theoretical Computer Science, vol.25, 1983.

R. Mil844 and . Milner, A complete inference system for a class of regular behaviours, Journal of Computer and System Sciences, vol.28, p.4399466, 1984.

R. Mil899 and . Milner, Communication and concurrency, 1989.

L. Mou922 and . Mounier, M ethodes de v eriication de sp eciications comportementales : etude et mise en uvre. T h ese, 1992.

M. Z. Manna, A. Pnueli, R. S. Boyer, and J. S. Moore, The temporal framework for concurrent programs The correctness problem in computer science, p.2155274, 1981.

M. Z. Manna, A. Pnueli, J. W. De-bakker, W. P. D-e-r-o-e-v-er, and G. Rozenberg, The anchored version of the temporal framework Linear time, branching time, and partial order in logics and models for concurrency, LNCS, vol.354, 1989.

M. F. Moller, C. Tofts, J. C. Baeten, and J. W. Klop, A temporal calculus of communicating processes Proceedings of CONCUR '90 Theories of concurrency: uniication and extension, LNCS, vol.458, p.4011415, 1990.

M. Z. Manna and P. W. Olper, Synthesis of communicating processes from temporal logic speciications, ACM Transactions on Programming Languages and Systems, vol.61, pp.688-93, 1984.
DOI : 10.1007/bfb0025786
URL : http://orbi.ulg.ac.be/request-copy/2268/116690/129141/toplas84.pdf

N. X. Nicollin, J. Richier, J. Sifakis, and J. Voiron, ATP: an algebra for timed processes, Proceedings of the IFIP TC 2 working conference o n P r ogramming Concepts and Methods, 1990.

N. X. Nicollin and J. Sifakis, The algebra of timed processes ATP: theory and application. Information and Computation, a para^ tre, 1990.

N. X. Nicollin and J. Sifakis, An overview and synthesis on timed process algebras
DOI : 10.1007/3-540-55179-4_36
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.6010

N. X. Nicollin, J. Sifakis, and S. Yovine, From ATP to timed gaphs and hybrid systems Proceedings of REX workshop Real-time: theory in practice, LNCS, vol.600, 1991.

N. X. Nicollin, J. Sifakis, and S. Yovine, Compiling real-time speciications into timed automata IEEE Transactions on Software Engineering, special issue on speciication and analysis of real-time systems, p.7944804, 1992.

O. S. Owicki and L. Lamport, Proving Liveness Properties of Concurrent Programs, ACM Transactions on Programming Languages and Systems, vol.4, issue.3, p.4555595, 1982.
DOI : 10.1145/357172.357178

D. M. Par800 and . Park, Concurrency and automata on innnite sequences, LNCS, vol.104, 1980.

G. D. Plo811 and . Plotkin, A structural approach to operational semantics Rapport de recherche DAIMI FN-19, 1981.

A. Pnu777 and . Pnueli, The temporal logic of concurrent programs, Proceedings of 12 th ICALP, 1977.

A. Pnu866 and . Pnueli, Applications of temporal logic to the speciication and veriication of reactive systems: a survey of current trends, LNCS, vol.224, p.5100584, 1986.

Q. J. Queille and J. Sifakis, Speciication and veriication of concurrent systems in CE- SAR, Proceedings of 5 th International Symposium in Programming, p.3377351, 1981.

C. Rat922, Lesar : un outil pour la v eriication d'invariants de programmes Lustre

P. Ray911, Compilation eecace d'un langage d eclaratif synchrone : le g en erateur de code Lustre-V3. T h ese, 1991.

C. Rod888 and . Rodriguez, Sp eciication et validation de syst emes en Xesar, Th ese, Institut National Polytechnique de, 1988.

R. G. Reed and A. W. Roscoe, A timed model for Communicating Sequential Processes, Theoretical Computer Science, vol.58, p.2499261, 1988.

R. Richier, C. Rodriguez, J. Sifakis, and J. Voiron, Xesar: A T ool for Protocol Validation. User's Guide. LGI-IMAG, 1987.

R. Richier, J. Sifakis, and J. Voiron, Une alg ebre des processus temporis es, 1987.

S. Sch911 and . Schneider, An o p erational semantics for Timed CSP. Programming Research Group, 1991.

J. Sif822 and . Sifakis, A uniied approach for studying the properties of transition systems, Theoretical Computer Science, vol.18, 1982.

D. Ver877, A. Vergamini, M. Valmari, and . Tienari, V eriication de r eseaux d'automates nis par equivalences observationnelles : le syst eme AUTO. T h ese An improved failure equivalence for nite-state systems with a reduction algorithm, Proceedings of the 11 th IFIP international workshop on Protocol Speciication, Testing and Veriication, 1987.

W. Wang-yi, J. C. Baeten, and J. W. Klop, Real-time behaviour of asynchronous agents, Proceedings of CONCUR '90 Theories of concurrency: uniication and extension, p.5022520, 1990.
DOI : 10.1007/BFb0039080

W. Wang and Y. , CCS + time = an interleaving model for real time systems, Monien et M. Rodr guez Artalejo, editeurs Proceedings of ICALP '91, 1991.