Factored Planning: From Automata to Petri Nets - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Factored Planning: From Automata to Petri Nets

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-00931844 , version 1

Citer

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⟩
490 Consultations
147 Téléchargements

Partager

Gmail Facebook X LinkedIn More