---
title: "Refining and Extending the Procedural Net"
authors:
  - "Mark Drummond"
doi: ""
url: "https://ijcai.org/proceedings/1985/202"
pdf: "https://ijcai.org/proceedings/1985/0202.pdf"
venue: "Proceedings of the Ninth International Joint Conference on Artificial Intelligence"
year: 1985
pages: "1010-1011"
track: "Planning and Search"
keywords:
---

# Refining and Extending the Procedural Net

Mark Drummond

*Proceedings of the Ninth International Joint Conference on Artificial Intelligence*, pages 1010-1011.

## Abstract

This paper presents a new definition for Plans. The objects defined are called Plan Nets, and are similar in spirit to Sacerdoti's Procedural Nets (1975) . It is argued that Plan Nets are more descriptive than Procedural Nets, because they can easily describe iterative behaviour . The Plan Net definition is motivated by providing an operational s emanlies for the Procedural Net, and noticing that all Procedural Net state spaces are "loop free". This is seen to restriet the behaviours that can be described by the Procedural Net to those which do not include iteration. It is suggested that Plan Net state spaces can contain loops, and thus can describe iterative behaviour .