Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

Coverability and Inhibitor Arcs: an example

Lookup NU author(s): Professor Henriette Kleijn, Emeritus Professor Maciej KoutnyORCiD

Downloads

Licence

This is the final published version of a report that has been published in its final definitive form by School of Computing Science, University of Newcastle upon Tyne, 2011.

For re-use rights please refer to the publisher's terms and conditions.

Abstract

Inhibitor arcs pose a problem for the standard Coverability Tree Construction for Place/Transition Nets. A straightforward modification of the construction circumventing this problem works for PT-nets with one inhibitor place. Here it is shown that this modified construction may not terminate in case of two or more inhibitor places.

Publication metadata

Author(s): van der Vlugt S, Kleijn J, Koutny M

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2011

Pages: 8

Print publication date: 01/11/2011

Source Publication Date: November 2011

Report Number: 1293

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

Share