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

F. Bacchus and Q. Yang, Downward refinement and the efficiency of hierarchical problem solving, Artificial Intelligence, vol.71, issue.1, pp.43-100, 1994.
DOI : 10.1016/0004-3702(94)90062-0

C. Bäckström, Equivalence and Tractability Results for SAS+ Planning, Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, pp.126-137, 1992.

P. Baldan, N. Busi, A. Corradini, and G. M. Pinna, Domain and Event Structure Semantics for Petri Nets with Read and Inhibitor Arcs, Teoretical Computer Science, vol.323, issue.1-3, pp.129-189, 2004.

P. Baldan, A. Corradini, and U. Montanari, Contextual Petri Nets, Asymmetric Event Structures, and Processes, Information and Computation, vol.171, issue.1, pp.1-49, 2001.
DOI : 10.1006/inco.2001.3060
URL : http://doi.org/10.1006/inco.2001.3060

C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1, Proceedings of ICC '93, IEEE International Conference on Communications, pp.1064-1070, 1993.
DOI : 10.1109/ICC.1993.397441

J. Berstel, Transductions and Context-Free Languages. Electronic Edition, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00619779

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
URL : http://doi.org/10.1016/s0004-3702(96)00047-1

H. Bodlaender, A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth, Proceedings of the 25th annual ACM Symposium on Theory of Computing, pp.226-234, 1993.

B. Bonet and H. Geffner, Planning as heuristic search, Artificial Intelligence, vol.129, issue.1-2, pp.5-33, 2001.
DOI : 10.1016/S0004-3702(01)00108-4

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.

R. Brafman and C. Domshlak, Factored Planning: How, When, and When Not, Proceedings of the 21st AAAI Conference on Artificial Intelligence, pp.809-814, 2006.

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.

A. Buchsbaum, R. Giancarlo, and J. Westbrook, On the Determinization of Weighted Finite Automata, SIAM Journal on Computing, vol.30, issue.5, pp.1502-1531, 2000.
DOI : 10.1137/S0097539798346676

T. Bylander, Complexity Results for Planning, Proceedings of the 12th International Joint Conference on Artificial Intelligence, pp.274-279, 1991.

C. Cassandras and S. Lafortune, Introduction to Discrete Event Systems, 1999.

Y. Chen, B. Wah, and C. Hsu, Temporal Planning Using Subgoal Partitioning and Resolution in SGPlan, Journal of Artificial Intelligence Research, vol.26, issue.1, pp.323-369, 2006.

C. Choffrut, Une caracterisation des fonctions sequentielles et des fonctions sous-sequentielles en tant que relations rationnelles, Theoretical Computer Science, vol.5, issue.3, pp.325-337, 1977.
DOI : 10.1016/0304-3975(77)90049-4

J. Choi and E. Amir, Factored Planning for Controlling a Robotic Arm: Theory, Proceedings of the 5th International Workshop on Cognitive Robotics, pp.47-54, 2006.

J. Culberson and J. Schaeffer, Pattern Databases, Computational Intelligence, vol.14, issue.3, pp.318-334, 1998.
DOI : 10.1111/0824-7935.00065

R. Dechter, Constraint Processing, 2003.

E. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

S. Edelkamp, Planning with Pattern Databases, Proceedings of the 12th International Conference on Automated Planning and Scheduling, pp.13-24, 2001.

K. Erol, D. Nau, and V. S. Subrahmanian, On the Complexity of Domain-Independent Planning, Proceedings of the 10th AAAI Conference on Artificial Intelligence, pp.381-386, 1992.

J. Esparza, S. Romer, and W. Vogler, An Improvement of McMillan's Unfolding Algorithm. Formal Methods in System Design, pp.285-310, 1996.

E. Fabre, Convergence of the Turbo Algorithm for Systems Defined by Local Constraints, 2003.

E. Fabre, Bayesian Networks of Dynamic Systems. Habilitation à diriger des recherches, 2007.

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 and L. Jezequel, On the construction of probabilistic diagnosers, Proceedings of the 10th International Workshop on Discrete Event Systems, pp.229-234, 2010.
DOI : 10.3182/20100830-3-DE-4013.00039

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.

R. Fikes and N. Nilsson, Strips: A new approach to the application of theorem proving to problem solving, Artificial Intelligence, vol.2, issue.3-4, pp.189-208, 1971.
DOI : 10.1016/0004-3702(71)90010-5

C. Gazen and C. Knoblock, Combining the expressivity of UCPOP with the efficiency of Graphplan, proceedings of the 4th European Conference on Planning, pp.221-233, 1997.
DOI : 10.1007/3-540-63912-8_88

M. Ghallab, C. Isi, S. Penberthy, and D. Smith, Ying Sun, and Daniel Weld. PDDL -The Planning Domain Definition Language, 1998.

M. Ghallab, D. Nau, and P. Traverso, Automated Planning: Theory and Practice, 2004.

C. Green, Application of Theorem Proving to Problem Solving, Proceedings of the 1st International Joint Conference on Artificial Intelligence, pp.219-239, 1969.

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

P. Hart, N. Nilsson, and B. Raphael, <u>Correction</u> to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths", ACM SIGART Bulletin, vol.37, issue.37, pp.28-29, 1972.
DOI : 10.1145/1056777.1056779

P. Haslum, Admissible Heuristics for Automated Planning, 2006.

P. Haslum, Reducing Accidental Complexity in Planning Problems, Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp.1898-1903, 2007.

P. Haslum and H. Geffner, Admissible Heuristics for Optimal Planning, Proceedings of the 5th International Conference on Automated Planning and Scheduling, pp.140-149, 2000.

P. Haslum, M. Helmert, and J. Hoffmann, Explicit-State Abstraction: A New Method for Generating Heuristic Functions, proceedings of the 23rd AAAI Conference on Artificial Intelligence, pp.1547-1550, 2008.

M. Helmert, The Fast Downward Planning System, Journal of Artificial Intelligence Research, vol.26, issue.1, pp.191-246, 2006.

M. Helmert and C. Domshlak, Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?, Proceedings of the 19th International Conference on Automated Planning and Scheduling, pp.162-169, 2009.

M. Helmert, P. Haslum, and J. Hoffmann, Flexible Abstraction Heuristics for Optimal Sequential Planning, Proceedings of the 17th International Conference on Automated Planning and Scheduling, pp.176-183, 2007.

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.

J. Hoffmann, S. Edelkamp, S. Thiébaux, R. Englert, F. et al., Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4, Journal of Artificial Intelligence Research, vol.26, issue.1, pp.453-541, 2006.

J. Hoffmann, J. Porteous, and L. Sebastia, Ordered Landmarks in Planning, Journal of Artificial Intelligence Research, vol.22, issue.1, pp.215-278, 2004.

L. Jezequel and E. Fabre, Networks of automata with read arcs: a tool for distributed planning, Proceedings of the 18th IFAC World Congress, pp.7012-7017, 2011.
DOI : 10.3182/20110828-6-IT-1002.03512

L. Jezequel and E. Fabre, A#: A distributed version of A* for factored planning, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC), p.page to appear, 2012.
DOI : 10.1109/CDC.2012.6426187

L. Jezequel and E. Fabre, A-sharp: A Distributed A-star for Factored Planning
URL : https://hal.archives-ouvertes.fr/hal-00687434

L. Jezequel and E. Fabre, Turbo Planning, Proceedings of the 11th International Workshop on Discrete Event Systems, 2012.
DOI : 10.3182/20121003-3-MX-4033.00049

A. Junghanns and J. Schaeffer, Domain-Dependent Single-Agent Search Enhancements, Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp.570-577, 1999.

E. Karpas and C. Domshlak, Cost-Optimal Planning With Landmarks, Proceedings of the 21st International Joint Conference on Artificial Intelligence, pp.1728-1733, 2009.

H. Kautz, B. Selman, and J. Hoffmann, SATPLAN: Planning as Satisfiability, 5th International Planning Competition Booklet, pp.45-46, 2006.

E. Kelareva, O. Buffet, J. Huang, and S. Thiébaux, Factored Planning Using Decomposition Trees, Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp.1942-1947, 2007.

D. Kirsten, A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata. RAIRO -Theoretical Informatics and Applications, pp.553-581, 2008.

D. Kirsten and . Decidability, Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring, Theoretical Computer Science, vol.420, pp.56-63, 2012.
DOI : 10.1016/j.tcs.2011.11.006

D. Kirsten and S. Lombardy, Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata, Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, pp.589-600, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00360205

D. Kirsten and I. Maürer, On the Determinization of Weighted Automata, Journal of Automata, Languages and combinatorics, vol.10, issue.2, pp.287-312, 2005.

I. Klimann, S. Lombardy, J. Mairesse, and C. Prieur, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, Theoretical Computer Science, vol.327, issue.3, pp.349-373, 2004.
DOI : 10.1016/j.tcs.2004.02.049
URL : https://hal.archives-ouvertes.fr/hal-00174171

C. Knoblock, Learning Abstraction Hierarchies for Problem Solving, Proceedings of the 8th National Conference on Artificial Intelligence, pp.923-928, 1990.

C. Knoblock, Automatically generating abstractions for planning, Artificial Intelligence, vol.68, issue.2, pp.243-302, 1994.
DOI : 10.1016/0004-3702(94)90069-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.4337

C. Knoblock, Generating Parallel Execution Plans With a Partial-Order Planner, Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems, pp.98-103, 1994.

R. Korf, Depth-first iterative-deepening, Artificial Intelligence, vol.27, issue.1, pp.97-109, 1985.
DOI : 10.1016/0004-3702(85)90084-0

R. Korf, Real-time heuristic search, Artificial Intelligence, vol.42, issue.2-3, pp.189-211, 1990.
DOI : 10.1016/0004-3702(90)90054-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.809

R. Korf, Finding Optimal Solutions to Rubik's Cube Using Pattern Databases, Proceedings of the 14th National Conference on Artificial Intelligence, pp.700-705, 1997.

S. Lombardy and J. Mairesse, Series which are both max-plus and min-plus rational are unambiguous, RAIRO -Theoretical Informatics and Applications, pp.1-14, 2006.
DOI : 10.1051/ita:2005042
URL : https://hal.archives-ouvertes.fr/hal-00017220

R. Mceliece, D. Mackay, and J. Cheng, Turbo decoding as an instance of Pearl's "belief propagation" algorithm, IEEE Journal on Selected Areas in Communications, vol.16, issue.2, pp.140-152, 1998.
DOI : 10.1109/49.661103

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

M. Mohri, Minimization of sequential transducers, Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, pp.151-163, 1994.
DOI : 10.1007/3-540-58094-8_14

M. Mohri, On some applications of finite-state automata theory to natural language processing, Natural Language Engineering, vol.2, issue.1, pp.61-80, 1996.
DOI : 10.1017/S135132499600126X

M. Mohri, Finite-State Transducers in Language and Speech Processing, Computational Linguistics, vol.23, issue.2, pp.269-311, 1997.

M. Mohri, Weighted Finite-State Transducer Algorithms: An Overview. Formal Languages and Applications, pp.551-564, 2004.

M. Mohri, Handbook of Weighted Automata, 2009.

J. Pearl, Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach, Proceedings of the 2nd National Conference on Artificial Intelligence, pp.133-136, 1982.

J. Pearl, Fusion, propagation, and structuring in belief networks, Artificial Intelligence, vol.29, issue.3, pp.241-288, 1986.
DOI : 10.1016/0004-3702(86)90072-X

J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, 1986.

S. Richter, M. Helmert, and M. Westphal, Landmarks Revisited, Proceedings of the 23rd AAAI Conference on Artificial Intelligence, pp.975-982, 2008.

R. Su, Distributed Diagnosis for Discrete-Event Systems, 2004.

R. Su and W. M. Wonham, Global and local consistencies in distributed fault diagnosis for discrete-event systems, IEEE Transactions on Automatic Control, vol.50, issue.12, pp.1923-1935, 2005.
DOI : 10.1109/TAC.2005.860291

R. Su, W. M. Wonham, J. Kurien, and X. Koutsoukos, Distributed diagnosis for qualitative systems, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings., pp.169-174, 2002.
DOI : 10.1109/WODES.2002.1167684

D. Thorsley and D. Teneketzis, Diagnosability of stochastic discrete-event systems, IEEE Transactions on Automatic Control, vol.50, issue.4, pp.476-492, 2005.
DOI : 10.1109/TAC.2005.844722

W. Zielonka, The Book of Traces, chapter 7, World Scientific, 1995.