Factored Planning: From Automata to Petri Nets

Loïg Jezequel 1, * Eric Fabre 2 Victor Khomenko 3
* Auteur correspondant
2 SUMO - SUpervision of large MOdular and distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : 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.
Type de document :
Communication dans un congrès
International Conference on Application of Concurrency to System Design (ACSD), Jul 2013, Barcelone, Spain. 2013
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00931844
Contributeur : Eric Fabre <>
Soumis le : mercredi 15 janvier 2014 - 21:26:56
Dernière modification le : mercredi 11 avril 2018 - 02:00:54
Document(s) archivé(s) le : samedi 8 avril 2017 - 17:02:16

Fichier

final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00931844, version 1

Citation

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. 2013. 〈hal-00931844〉

Partager

Métriques

Consultations de la notice

349

Téléchargements de fichiers

102