Planning as search: a quantitative approach
Artificial Intelligence
Transformations and decompositions of nets
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Automatic abstraction in planning
Automatic abstraction in planning
Automatically generating abstractions for planning
Artificial Intelligence
Creating abstractions using relevance reasoning
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Speeding up problem solving by abstraction: a graph oriented approach
Artificial Intelligence - Special volume on empirical methods
Human Problem Solving
Journal of Computer and System Sciences
A fuzzy reasoning design for fault detection and diagnosis of a computer-controlled system
Engineering Applications of Artificial Intelligence
On linear logic planning and concurrency
Information and Computation
| Hi-index | 0.00 |
The Petri net model is a powerful state transition oriented model to analyse, model and evaluate asynchronous and concurrent systems. However, like other state transition models, it encounters the state explosion problem. The size of the state space increases exponentially with the system complexity. This paper is concerned with a method of abstracting automatically Petri nets to simpler representations, which are ordered with respect to their size. Thus it becomes possible to check Petri net reachability incrementally. With incremental approach we can overcome the exponential nature of Petri net reachability checking. We show that by using the incremental approach, the upper computational complexity bound for Petri net reachability checking with optimal abstraction hierarchies is polynomial. The method we propose considers structural properties of a Petri net as well an initial and a final marking. In addition to Petri net abstraction irrelevant transitions for a given reachability problem are determined. By removing these transitions from a net, impact of the state explosion problem is reduced even more.