K. R. Apt, N. Francez, and W. P. De-roever, A Proof System for Communicating Sequential Processes, ACM Transactions on Programming Languages and Systems, vol.2, issue.3, pp.359-385, 1980.
DOI : 10.1145/357103.357110

G. [. Benveniste and . Berry, The synchronous approach to reactive and real-time systems, Proceedings of the IEEE, vol.79, issue.9, pp.1270-1282, 1991.
DOI : 10.1109/5.97297
URL : https://hal.archives-ouvertes.fr/inria-00075115

F. Boniol, A. Burgueño, O. Roux, and V. Rusu, Analysis of slope-parametric hybrid automata, Lecture Notes in Computer Science, vol.1201, issue.2, p.75, 1997.
DOI : 10.1007/BFb0014715

]. F. Bd91, R. Boussinot, and . De-simone, The esterel language, Proceedings of the IEEE, pp.1293-1304, 1991.

]. P. Boi99 and . Boisieau, Vérification et exécution d'applications temps-réel industrielles avec Electre, 1999.

O. [. Boisieau and . Roux, Splitting reachability analysis in hybrid automata, Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99, pp.98-105, 1999.
DOI : 10.1109/EMRTS.1999.777455

O. [. Cassez and . Roux, Compilation of the ELECTRE reactive language into finite transition systems, Theoretical Computer Science, vol.146, issue.1-2, pp.109-143, 1995.
DOI : 10.1016/0304-3975(94)00136-7

N. [. Elrad and . Francez, Decomposition of distributed programs into communicationclosed layers, Science of Computer Programming, vol.2, issue.3 3, 1982.

]. J. Esp94 and . Esparza, Model checking using net unfoldings, Science of Computer Programming, vol.23, issue.23, pp.151-195, 1994.

J. [. Gouda and . Han, Protocol validation by fair progress state exploration . Computer Networks and ISDN systems, pp.353-361, 1985.

G. P. Godefroid, G. J. Holzmann, and D. Pirottin, State space caching revisited. Formal Methods in System Design, Proc. CAV92, pp.1-15, 1995.

R. Gerth, R. Kuiper, D. Peled, and W. Penczek, A partial order approach to branching time logic model checking, Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1999.
DOI : 10.1109/ISTCS.1995.377038

D. [. Grumberg and . Long, Model checking and modular verification, ACM Transactions on Programming Languages and Systems, vol.16, issue.3, pp.843-871, 1994.
DOI : 10.1145/177492.177725

P. Godefroid, Using partial orders to improve automatic verification methods, Proceedings of the 2nd International Conference on Computer-Aided Verification (CAV '90) number 531 in Lecture Notes in Computer Science, pp.176-185, 1990.
DOI : 10.1007/BFb0023731

P. Godefroid, On the costs and benefits of using partial-order methods for the verification of concurrent systems, Proceedings of DIMACS Workshop on Partial-Order Methods in Verification, 1996.

P. Godefroid, Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem, 1996.
DOI : 10.1007/3-540-60761-7

D. [. Godefroid and . Pirottin, Refining dependencies improves partial-order verification methods (extended abstract), Proceedings of the 5th International Conference on Computer Aided Verification, Greece, number 697 in Lecture Notes in Computer Science, pp.409-423, 1993.
DOI : 10.1007/3-540-56922-7_36

P. Godefroid, D. Peled, and M. Staskauskas, Using partial-order methods in the formal validation of industrial concurrent programs, IEEE Transactions on software engineering, vol.22, issue.7, 1996.

P. [. Godefroid and . Wolper, A partial approach to model checking, 6th symposium on logic in computer science, 1991.

P. [. Godefroid and . Wolper, Using partial orders for the efficient verification of deadlock freedom and safety properties, Proceedings of Computer Aided Verification (CAV '91), pp.332-342, 1992.

P. [. Godefroid and . Wolper, Partial-order methods for temporal verification. CONCUR '93, Proceedings Lecture Notes in Computer Science, vol.715, pp.233-246, 1993.

N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, The synchronous dataflow language lustre, Proceedings of the IEEE, pp.1304-1320, 1991.

G. J. Holzmann, P. Godefroid, and D. Pirottin, Coverage Preserving Reduction Strategies for Reachability Analysis, Proc. 12th Int. Conf on Protocol Specification , Testing, and Verification, 1992.
DOI : 10.1016/B978-0-444-89874-6.50028-3

G. J. Holzmann, Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching, IEEE Transactions on Software Engineering, vol.13, issue.6, pp.683-696, 1987.
DOI : 10.1109/TSE.1987.233206

D. [. Holzmann and . Peled, An Improvement in Formal Verification, 1994.
DOI : 10.1007/978-0-387-34878-0_13

J. [. Janssen and . Zwiers, Specifying and proving communication closedness in protocols, Proc. 13th IFIP WG 6.1 International Symposium on Protocol Specification, Testing and Verification, pp.323-339, 1993.

S. [. Kornatzky and . Pinter, A model checker for partial order temporal logic, 1986.

D. [. Katz and . Peled, Interleaving set temporal logic, Proceedings of the 6 th Annual ACM Symposium on Principles of Distributed Computing, pp.178-190, 1987.
DOI : 10.1007/3-540-51803-7_20
URL : http://dx.doi.org/10.1016/0304-3975(90)90096-z

S. Katz and D. Peled, Defining conditional independence using collapses, Theoretical Computer Science, vol.101, issue.2, pp.337-359, 1992.
DOI : 10.1016/0304-3975(92)90054-J

S. Katz and D. Peled, Verification of distributed programs using representative interleaving sequences, Distributed Computing, vol.11, issue.3, pp.107-120, 1992.
DOI : 10.1007/BF02252682

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

P. , L. Guernic, A. Benveniste, P. Bournai, and T. Gautier, signal: a data-flow oriented language for signal processing, IEEE transactions on ASSP, issue.2 21, pp.34362-374, 1986.
URL : https://hal.archives-ouvertes.fr/inria-00076178

]. A. Maz86 and . Mazurkiewicz, Trace theory In Petri Nets: Applications and Relationships to Other Models of Concurrency Advances in Petri Nets, Part II: Proceedings of an Advanced Course, pp.279-324, 1986.

K. L. Mcmillan, Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits, Proc. International Workshop on Computer Aided Verification, pp.164-177, 1992.
DOI : 10.1007/3-540-56496-9_14

K. L. Mcmillan, Symbolic Model Checking, 1993.

Z. Manna and A. Pnueli, Models for reactivity, Acta Informatica, vol.83, issue.1, pp.609-678, 1993.
DOI : 10.1007/BF01191722

]. W. Ove81 and . Overman, Verification of concurrent systems: function and timing, 1981.

]. F. Pag96 and . Pagani, Partial orders and verification of real-time systems, Lecture Notes in Computer Science, vol.1135, p.327

]. D. Pel93 and . Peled, All from one, one from all: on model checking using representatives, Proceedings of the 5th International Conference on Computer Aided Verification, Greece, number 697 in Lecture Notes in Computer Science, pp.409-423, 1993.

]. D. Pel94 and . Peled, Combining partial order reductions with on-the-fly model-checking, Lecture Notes in Computer Science, vol.818, p.377, 1994.

]. W. Pen88 and . Penczek, A temporal logic for event structures, Fundamenta Informaticae, vol.11, issue.3 3, pp.297-326, 1988.

]. W. Pen90 and . Penczek, Proving partial order properties using cctl, Proc. Concurrency and Compositionality Workshop, 1990.

D. [. Pnueli and . Harel, On the Development of Reactive Systems, volume F 13 of NATO ASI, pp.477-498, 1985.

A. Pnueli, Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends, Current trends in Concurrency: Overviews and Tutorials, pp.510-584, 1986.
DOI : 10.1007/BFb0027047

A. Pnueli, Specification and development of reactive systems, Information Processing, 1986.

]. V. Pra86 and . Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming, vol.15, issue.1, pp.33-71, 1986.

J. Perraud, O. Roux, and M. Huou, Operational semantics of a kernel of the language ELECTRE, Theoretical Computer Science, vol.97, issue.1, pp.83-104, 1992.
DOI : 10.1016/0304-3975(92)90388-V

P. [. Pinter and . Wolper, A temporal logic to reason about partially ordered computations, Proc. 3rd ACM Symp. on Principles of Distributed Computing, pp.28-37, 1984.

F. A. Stomp and W. P. De-roever, Designing distributed algorithms by means of formal sequentially phased reasoning, Distributed Algorithms, 3rd International Workshop, pp.242-253, 1989.
DOI : 10.1007/3-540-51687-5_47

G. Sutre, A. Finkel, O. Roux, and F. Cassez, Effective Recognizability and Model Checking of Reactive Fiffo Automata, Lecture Notes in Computer Science, vol.1548, issue.2, pp.106-123, 1999.
DOI : 10.1007/3-540-49253-4_10

A. Valmari, Error detection by reduced reachability graph generation, Proc. 9th International Conference on Application and Theory of Petri Nets, pp.95-112, 1988.

A. Valmari, Heuristics for lazy state generation speeds up analysis of concurrent systems, Proc. of the Finnish Artificial Intelligence Symposium STeP-88, pp.640-650, 1988.

A. Valmari, A stubborn attack on state explosion, Lecture Notes in Computer Science, vol.531, issue.3, p.156, 1991.
DOI : 10.1007/BFb0023729

A. Valmari, Stubborn sets for reduced state space generation Advances in Petri Nets'90, LNCS, vol.483, 1991.

]. A. Val93 and . Valmari, On-the-fly verification with stubborn sets, Proc. 5th Conference on Computer Aided Verification, pp.397-408, 1993.

]. C. Wes86 and . West, Protocol validation by random state exploration, Proc. 6th IFIP WG 6.1 International Symposium on Protocol Specification, Testing and Verification, pp.233-242, 1986.

]. G. Win86 and . Winskel, Event structures Petri nets: central models and their properties; advances in Petri nets; proceedings of an advanced course, Bad Honnef, 8.-19, Lecture Notes in Computer Science, vol.2, issue.255 3, 1986.

B. Willems and P. Wolper, Partial-order methods for model checking: from linear time to branching time, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 1997.
DOI : 10.1109/LICS.1996.561357