Browse by author
Lookup NU author(s): Professor Henriette Kleijn, Professor Maciej KoutnyORCiD
For Petri nets with inhibitor arcs, properties like reachability and boundedness are undecidable and hence constructing a coverability tree is not feasible. Here it is investigated to what extent the coverability tree construction might be adapted for Petri nets with inhibitor arcs. Emphasis is given to the (a priori) step sequence semantics which cannot always be simulated by firing sequences. All this leads to the notion of a step coverability tree which may be of use for the analysis of the step behaviour of certain subclasses of Petri nets with inhibitor arcs.
Author(s): Kleijn J, Koutny M
Publication type: Report
Publication status: Published
Series Title: School of Computing Science Technical Report Series
Year: 2008
Pages: 30
Print publication date: 01/09/2008
Source Publication Date: September 2008
Report Number: 1118
Institution: School of Computing Science, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/1118.pdf
