Factored Planning: From Automata to Petri Nets

Abstract : Factored planning mitigates the state explosion problem by avoiding the construction of the state space of the whole system and instead working with the system's components. Traditionally, finite automata have been used to represent the components, with the overall system being represented as their product. In this article, we change the representation of components to safe Petri nets. This allows one to use cheap structural operations like transition contractions to reduce the size of the Petri net before its state space is generated, which often leads to substantial savings compared with automata. The proposed approach has been implemented and proved efficient on several factored planning benchmarks. This article is an extended version of our ACSD 2013 paper [Jezequel et al. 2013], with the addition of the proofs and the experimental results of Sections 6 and 7.
Type de document :
Article dans une revue
ACM Transactions on Embedded Computing Systems (TECS), ACM, 2015, 14 (2), 〈10.1145/2656215〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01247347
Contributeur : Eric Fabre <>
Soumis le : lundi 21 décembre 2015 - 17:24:51
Dernière modification le : mercredi 16 mai 2018 - 11:48:03

Identifiants

Citation

Loïg Jezequel, Eric Fabre, Victor Khomenko. Factored Planning: From Automata to Petri Nets. ACM Transactions on Embedded Computing Systems (TECS), ACM, 2015, 14 (2), 〈10.1145/2656215〉. 〈hal-01247347〉

Partager

Métriques

Consultations de la notice

389