Planning via Petri net unfolding

Authors:
Sarah Hickmott;Jussi Rintanen;Sylvie Thiébaux;Lang White
Affiliations:
National ICT Australia, School of Electrical & Electronic Engineering, The University of Adelaide;National ICT Australia, Computer Sciences Laboratory, The Australian National University;National ICT Australia, Computer Sciences Laboratory, The Australian National University;National ICT Australia, School of Electrical & Electronic Engineering, The University of Adelaide
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 11
Cited 7

Fast planning through planning graph analysis

Artificial Intelligence
Planning as heuristic search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Directed explicit model checking with HSF-SPIN

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
Evaluating Deadlock Detection Methods for Concurrent Software

IEEE Transactions on Software Engineering
Using Partial Orders to Improve Automatic Verification Methods

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Combining the Expressivity of UCPOP with the Efficiency of Graphplan

ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Unfolding Based Algorithms for the Reachability Problem

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
The GRT planning system: backward heuristic construction in forward state-space planning

Journal of Artificial Intelligence Research
Action Planning for Directed Model Checking of Petri Nets

Electronic Notes in Theoretical Computer Science (ENTCS)

Limits and Possibilities of BDDs in State Space Search

KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Directed Unfolding of Petri Nets

Transactions on Petri Nets and Other Models of Concurrency I
An Optimality Principle for Concurrent Systems

AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Encoding of Planning Problems and Their Optimizations in Linear Logic

Applications of Declarative Programming and Knowledge Management
Concurrent temporal planning using timed Petri nets: policy evaluation

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
An admissible heuristic for SAS+ planning obtained from the state equation

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Defining Multi-Party Compromises using Unfoldings of Workflow Nets

Fundamenta Informaticae - Concurrency, Specification and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The factored state representation and concurrency semantics of Petri nets are closely related to those of concurrent planning domains, yet planning and Petri net analysis have developed independently, with minimal and usually unconvincing attempts at cross-fertilisation. In this paper, we investigate and exploit the relationship between the two areas, focusing on Petri net unfolding, which is an attractive reachability analysis method as it naturally enables the recognition and separate resolution of independent subproblems. On the one hand, based on unfolding, we develop a new forward search method for cost-optimal partial-order planning which can be exponentially more efficient than state space search. On the other hand, inspired by well-known planning heuristics, we investigate the automatic generation of heuristics to guide unfolding, resulting in a more efficient, directed reachability analysis tool for Petri nets.