Skip to Main content Skip to Navigation
New interface
Conference papers

Factored Planning: From Automata to Petri Nets

Loïg Jezequel 1, * Eric Fabre 2 Victor Khomenko 3 
* Corresponding author
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Eric Fabre Connect in order to contact the contributor
Submitted on : Wednesday, January 15, 2014 - 9:26:56 PM
Last modification on : Tuesday, March 8, 2022 - 11:50:02 AM
Long-term archiving on: : Saturday, April 8, 2017 - 5:02:16 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads