Factored Planning: From Automata to Petri Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Factored Planning: From Automata to Petri Nets


Factored planning mitigates the state space 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 paper 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 proven efficient on several factored planning benchmarks.
Fichier principal
Vignette du fichier
final.pdf (262.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00931844 , version 1 (15-01-2014)


  • HAL Id : hal-00931844 , version 1


Loïg Jezequel, Eric Fabre, Victor Khomenko. Factored Planning: From Automata to Petri Nets. International Conference on Application of Concurrency to System Design (ACSD), Jul 2013, Barcelone, Spain. ⟨hal-00931844⟩
478 View
141 Download


Gmail Facebook Twitter LinkedIn More