Browse by author
Lookup NU author(s): Dr Victor Khomenko
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.
Author(s): Jezequel L, Fabre E, Khomenko V
Editor(s): Pietkiewicz-Koutny, M. and Lazarescu, M.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 13th International Conference on Application of Concurrency to System Design (ACSD'13)
Year of Conference: 2013
Date deposited: 02/08/2013
Publisher: IEEE Computing Society Press
Notes: Selected as one of best papers.