Reachability trees for high-level Petri nets
type: Item
instance of: scholarly article
title: Reachability trees for high-level Petri nets
zbMATH Open document ID: 0625.68042
DOI: 10.1016/0304-3975(86)90046-0
author: Arne M. Jensen
author: Leif O. Jepsen
author: Kurt Jensen
author: Peter J. Huber
published in: Theoretical Computer Science
publication date: 1986-01-01T00:00:00Z
review text: High-level Petri nets have been introduced as a powerful net type by which it is possible to handle rather complex systems in a succinct and manageable way. The success of high-level Petri nets is undebatable when we speak about description, but there is still much work to be done to establish the necessary analysis methods. In other papers it is shown how to generalize the concept of place- and transition invariants from place/transition nets to high-level Petri nets. Our present paper contributes to this with a generalization of reachability trees, which is one of the other important analysis methods known for place/transition nets.
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 4016200
zbMATH Keywords: high-level Petri nets
zbMATH Keywords: reachability trees
MaRDI profile type: Publication
full work available at URL: 0304-3975(86)90046-0
OpenAlex ID: W2092311420
cites work: System modelling with high-level Petri nets
cites work: Q3694702
cites work: Coloured Petri nets and the invariant-method
cites work: Q3928257
cites work: Q3670574
cites work: Parallel program schemata
cites work: Q3911403
cites work: Q3670575
description: scientific article; zbMATH DE number 4016200