H. R. Andersen, Model checking and boolean graphs, Theoretical Computer Science, vol.126, issue.1, pp.3-30, 1994.
DOI : 10.1016/0304-3975(94)90266-6

A. Bouajjani, J. Fernandez, S. Graf, C. Rodríguez, and J. Sifakis, Safety for branching time semantics, Proceedings of 18th ICALP, 1991.
DOI : 10.1007/3-540-54233-7_126

J. C. Baeten and R. J. Van-glabbeek, Another look at abstraction in process algebra, Proceedings of ICALP'87, pp.84-94, 1987.
DOI : 10.1007/3-540-18088-5_8

E. [. Clarke, A. P. Emerson, and . Sistla, Automatic verification of finite-state concurrent systems using temporal logic specifications, ACM Transactions on Programming Languages and Systems, vol.8, issue.2, pp.244-263, 1986.
DOI : 10.1145/5397.5399

]. R. Cs91a, B. Cleaveland, and . Steffen, Computing behavioural relations, logically, Proceedings of the 18th ICALP, pp.127-138, 1991.

]. R. Cs91b, B. Cleaveland, and . Steffen, A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus, Proceedings of 3rd Workshop on Computer Aided Verification CAV '91, pp.48-58, 1991.

X. Du, S. A. Smolka, and R. Cleaveland, Local model checking and protocol analysis, International Journal on Software Tools for Technology Transfer (STTT), pp.219-241, 1999.
DOI : 10.1007/s100090050031

C. [. Emerson and . Lei, Efficient Model Checking in Fragments of the Propositional Mu-Calculus, Proceedings of the 1st LICS, pp.267-278, 1986.

S. [. Fantechi, G. Gnesi, and . Ristori, From ACTL to Mu-Calculus, Proceedings of the ERCIM Workshop on Theory and Practice in Verification, pp.3-10, 1992.

. Jean-claude, C. Fernandez, T. Jard, L. Jéron, C. Nedelka et al., Using On-the-Fly Verification Techniques for the Generation of Test Suites, Proceedings of the 8th International Conference on Computer-Aided Verification, pp.348-359, 1996.

R. [. Fischer and . Ladner, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol.18, issue.2, pp.194-211, 1979.
DOI : 10.1016/0022-0000(79)90046-1

J. Fernandez and L. Mounier, ???On the fly??? verification of behavioural equivalences and preorders, Proceedings of the 3rd Workshop on Computer-Aided Verification, 1991.
DOI : 10.1007/3-540-55179-4_18

H. Garavel, . Open, and . Caesar, OPEN/C??SAR: An open software architecture for verification, simulation, and testing, Proceedings of the First International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS'98, pp.68-84, 1998.
DOI : 10.1007/BFb0054165

A. Mader, Verification of Modal Properties Using Boolean Equation Systems, 1997.

R. Mateescu, Efficient Diagnostic Generation for Boolean Equation Systems, Proceedings of 6th International Conference on Tools and Algorithms for INRIA the Construction and Analysis of Systems TACAS'2000, p.251
DOI : 10.1007/3-540-46419-0_18
URL : https://hal.archives-ouvertes.fr/inria-00072795

R. Mateescu, Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems, Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems TACAS'2002, pp.281-295, 2002.
DOI : 10.1007/3-540-46002-0_20
URL : https://hal.archives-ouvertes.fr/inria-00072158

[. Milner, Communication and Concurrency, 1989.

[. Mateescu and M. Sighireanu, Efficient on-the-fly model-checking for regular alternation-free mu-calculus, Science of Computer Programming, vol.46, issue.3, pp.255-281, 2003.
DOI : 10.1016/S0167-6423(02)00094-1
URL : https://hal.archives-ouvertes.fr/inria-00072755

R. De-nicola, U. Montanari, and F. Vaandrager, Back and forth bisimulations, CS R9021, Centrum voor Wiskunde en Informatica, 1990.
DOI : 10.1007/BFb0039058

[. Nicola and F. W. Vaandrager, Action versus state based logics for transition systems, Proceedings Ecole de Printemps on Semantics of Concurrency, pp.407-419, 1990.
DOI : 10.1007/3-540-53479-2_17

[. Park, Concurrency and automata on infinite sequences, Theoretical Computer Science, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

R. E. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010

R. J. Van-glabbeek and W. P. Weijland, Branching-Time and Abstraction in Bisimulation Semantics (extended abstract). CS R8911, Centrum voor Wiskunde en Informatica, Also in proc. IFIP 11th World Computer Congress, 1989.

B. Yang, R. E. Bryant, D. R. O-'hallaron, A. Biere, O. Condert et al., A Performance Study of BDD-Based Model Checking, Proceedings of FMCAD'98, pp.255-289, 1998.
DOI : 10.1007/3-540-49519-3_18

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-l` es-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004.

I. Editeur and . De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399