J. Esparza and K. Heljanko, Unfoldings ? A Partial-Order Approach to Model Checking, 2008.

A. Blum and M. Furst, Fast planning through planning graph analysis, Artificial Intelligence, vol.90, issue.1-2, pp.281-300, 1995.
DOI : 10.1016/S0004-3702(96)00047-1

V. Khomenko, A. Kondratyev, M. Koutny, and W. Vogler, Merged processes: a new condensed representation of Petri net behaviour, Acta Informatica, vol.77, issue.5, pp.307-330, 2006.
DOI : 10.1007/s00236-006-0023-y

E. Fabre, Trellis Processes : A Compact Representation for Runs of Concurrent Systems, Discrete Event Dynamic Systems, pp.267-306, 2007.
DOI : 10.1007/s10626-006-0001-0
URL : https://hal.archives-ouvertes.fr/inria-00070452

S. Hickmott, J. Rintanen, S. Thiébaux, and L. White, Planning via Petri net unfolding, Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp.1904-1911, 2007.

B. Bonet, P. Haslum, S. Hickmott, and S. Thiébaux, Directed Unfolding of Petri Nets, Transactions on Petri Nets and other Models of Concurrency, pp.172-198, 2008.
DOI : 10.1007/3-540-36577-X_34

E. Amir and B. Engelhardt, Factored planning, Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp.929-935, 2003.

R. Brafman and C. Domshlak, From one to many: Planning for loosely coupled multi-agent systems, Proceedings of the 18th International Conference on Automated Planning and Scheduling, pp.28-35, 2008.

E. Fabre, L. Jezequel, P. Haslum, and S. Thiébaux, Cost-optimal factored planning: Promises and pitfalls, Proceedings of the 20th International Conference on Automated Planning and Scheduling, pp.65-72, 2010.

J. C. Corbett, Evaluating deadlock detection methods for concurrent software, IEEE Transactions on Software Engineering, vol.22, issue.3, pp.161-180, 1996.
DOI : 10.1109/32.489078

W. Vogler and B. Kangsah, Improved decomposition of signal transition graphs, Fundamenta Informaticae, vol.78, issue.1, pp.161-197, 2007.

P. Hart, N. Nilsson, and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.
DOI : 10.1109/TSSC.1968.300136

J. Esparza, S. Romer, and W. Vogler, An improvement of McMillan's unfolding algorithm, Formal Methods in System Design, pp.285-310, 1996.
DOI : 10.1007/3-540-61042-1_40

E. Fabre and L. Jezequel, Distributed optimal planning: an approach by weighted automata calculus, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, pp.211-216, 2009.
DOI : 10.1109/CDC.2009.5400084
URL : https://hal.archives-ouvertes.fr/hal-00931846

E. Fabre, Bayesian networks of dynamic systems HabilitationàHabilitation`Habilitationà Diriger des Recherches, 2007.

V. Khomenko, M. Schaefer, and W. Vogler, Output-Determinacy and Asynchronous Circuit Synthesis, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), pp.541-579, 2008.
DOI : 10.1109/ACSD.2007.57

C. André, Structural Transformations Giving B-Equivalent PT-Nets, Proceedings of the 3rd European Workshop on Applications and Theory of Petri Nets, pp.14-28, 1982.
DOI : 10.1007/978-3-642-69028-0_2

V. Khomenko, M. Schaefer, W. Vogler, and R. Wollowski, STG decomposition strategies in combination with unfolding, Acta Informatica, vol.76, issue.4, pp.433-474, 2009.
DOI : 10.1007/s00236-009-0102-y

L. Jezequel and . Cachan, Distributed cost-optimal planning, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00825026