. En-d-'autres-termes,-puisque-la-cellule-est-oblig-ee-de-transmettre-le-jeton-qu-'elle-poss-ede,-elle-ne-reste-dans-un-etat-oo-u-elle-a-le-jeton-que-si-elle-en-ree-coit-un-autre, Pour permettre a la cellule de garder le jeton plus d'un coup d'horloge, il suaet de lui permettre de ne pas emettre le jeton lorsqu'elle n'en ree coit pas, i.e., de remplacer dans les transitions pr ec edentes les etiquettes ti:to ëAK86ë K. R. Apt and D. C. Kozen. Limits for automatic veriaecation of aenite-state concurrent systems, Information Processing Letters, vol.22, pp.307-309, 1986.

A. Arnold, Syst emes de transitions aenis et s emantique des processus communicants, 1992.

A. Bergeron, Easy problems in partial observation, 1994.

A. Bergeron, Sharing out control in distributed processes, Science of Computer Programming, pp.163-18687, 1992.
DOI : 10.1016/0304-3975(94)00132-3

. Biehl, . Morten, . Klarlund, . Nils, and T. Rauhe, Algorithms for guided tree automata, Proc. WIA '96, 1996.
DOI : 10.1007/3-540-63174-7_2

O. Coudert, C. Berthet, and J. C. Madre, Veriaecation of sequential machines using boolean functional vectors, 1989.

P. Cousot, R. Cousot, and R. Cousot, Abstract interpretation: a uniaeed lattice model for static analysis of programs by construction or approximation of aexpoints Comparing the Galois connection and wideningènarrowing approaches to abstract interpretation, 4th ACM Symposium on Principles of Programming Languages PLILP'92, 1992.

E. M. Clarke, E. A. Emerson, and A. P. Sistla, Automatic veriaecation of aenite-state concurrent systems using temporal logic speciaecations, 1986.

E. M. Clarke, O. Grumberg, and M. C. Browne, Reasonning about networks with many identical aenite-state processes, 5th ACM Symposium on Principles of Distributed Computing, pp.240-248, 1986.

E. M. Clarke, O. Grumberg, and S. Jha, Verifying parameterized networks using abstraction and regular languages, CONCUR'95, 1995.
DOI : 10.1007/3-540-60218-6_30

O. Coudert, J. C. Madre, and H. Touati, TiGeR version 1.0 user guide, 1993.

R. Cleaveland, J. Parrow, B. Steaeen, S. Eilenberg, . Automata et al., The concurrency workbench Reasoning about rings Automatic veriaecation of parameterized synchronous systems Cadp cçsarèaldebaran development packagee: A protocol validation and veriaecation toolbox Signal, a declarative language for synchronous programming of real-time systems Verifying invariants using theorem proving N. Halbwachs. Synchronous programming of reactive systems Statecharts: A visual approach to complex systems The synchronous dataaeow programming language Lustre, septembre 1991. ëHLR92aë N. Halbwachs, F. Lagnier, and C. Ratel. An experience in proving regular networks of processes by modular model checking The railroad crossing problem, modeling with Hybrid Argos -Analysis with Polka, Automatic Veriaecation Methods for Finite State Systems. J. Sifakis edd Proc. 22th ACM Conf. on Principles of Programming Languages, POPL'95 8th International Conferenceon Computer AidedV eriaecation, CAV'96, Proceedings of the 8th Conference on Computer-AidedV eriaecation Proc. 3rd. Conf. on Functional Programming Languages and Computer Architecture Conference on Computer AidedV eriaecation CAV'96 ëHal94ë N. Halbwachs. BAC, a Boolean Automaton Checker 2996è77:523í543, 1992. ëHLR92bë N. Halbwachs, F. Lagnier, and C. Ratel. Programming and verifying critical systems by means of the synchronous data-aeow programming language Lustre. IEEE Transactions on Software Ingeneering, Special Issue on the Speciaecation and Analysis of Real-Time Systems ëHLR93ë N. Halbwachs, F. Lagnier, and P.Raymond. Synchronous observers and the veriaecation of reactive systems Third Int. Conf. on Algebraic Methodology and Software Technology, AMAST'93, Twente, juin 1993. Workshops in Computing Second European Workshop on Real-Time and Hybrid Systems ëHPR94ë N. Halbwachs, Y. E. Proy, and P.Raymond. Veriaecation of linear hybrid systems by means of convex approximations International Symposium on Static Analysis, SAS'94, pp.437-4401305, 1974.

G. Hoaemann, H. Wongtoi, C. N. Ip, D. L. Dill, C. N. Ip et al., Symbolic synthesis of supervisory controllers Better veriaecation through symmetry Better veriaecation through symmetry Formal Methods in System Design, 991è2 Modeling and Control of Logical Discrete Event Systems A structural induction theorem for processes Edmonton Albertaa, ao^ ut 1989. ëKMM + 97ë Y Symbolic model checking with rich assertional languages The boolean automaton network grammar checker home page. http:èèwww.imag.frèVERIMAGèPEOPLEèDavid.LesensèBANG, 1997. ëLes97bë D. Lesens. Invariants of parameterized binary tree networks as greatest aexpoints Automatic construction of network invariants Automatic veriaecation of parameterized linear networks of processes Distributed mutual exclusion on a ring of processes:265í276, 1985. ëMar92ë F. Maraninchi. Operational and compositional semantics of synchronous automaton compositions Gormel-grammar oriented model checker Sifakis. The algebra of timed processes ATP: theory and application, American Control Conference 11th International Symposium on Computer Hardware Description Languages and Their Application 8th ACM Symposium on Principles of Distributed Computing submitted in 9th Conference on Computer Aided Veriaecation, CAV'97 Sixth International Conference on Algebraic Methodology and Software Technology, AMAST'97 International Workshop on Veriaecation of Inaenite State Systems, Inaeni- ty'96 24th ACM Symposium on Principles of Programming Languages, POPL'97 CONCUR'92, Stony Brook, ao^ ut 1992 ëMil80ë R. Milner. A Calculus of Communicating Systems SEGRAGRA'95, Joint COMPUGRAPHèSEMAGRAPH Workshop on Graph Rewriting and Computation. A. Corradini, U. Montanari r ed.., Elsevier Science B. V í ENTCS, pp.41-755, 1980.

J. P. Queille, J. Sifakis, C. Rackoae, P. J. Ramadge, W. M. Wonham et al., The covering and boundedness problems for vector addition systems 6622:223í231, avril 1978. ëRat92ë C. Ratel. D eaenition et r ealisation d'un outil de v eriaecation formelle de programmes Lustre : le syst eme Lesar Utilisation du calcul propositionnel en s^ uret e de fonctionnement, algorithmique sur les diagrammes binaires de d ecision Actes de l' ecole d' et e MOVEP'96, MOd elisation et VEriaecation des Processus parall eles Supervisory control of a class of discrete event processes The control of discrete event systems Think globally, act locally: decentralized supervisory control A tool for proving invariance properties of concurrent systems automatically Reasoning with many processes Network grammars, communication behaviors and automatic veriaecation Automatic veriaecation of a class of symmetric parallel programs Verifying properties of large sets of processes with network invariants, International Symposium on Programming Int. Workshop on Tools and Algorithms for the Construction and Analysis of Systems, TACAS'96 Workshop on Automatic Veriaecation Methods for Finite State Systems Proc. 13th IFIP World Computer Congress International Workshop on Automatic Veriaecation Methods for Finite State Systems, pp.138-152, 1982.