Reachability trees for high-level petri nets
Reads0
Chats0
TLDR
A generalization of reachability trees is contributed to, which is one of the other important analysis methods known for place/transition nets.About:
This article is published in Theoretical Computer Science.The article was published on 1986-06-01 and is currently open access. It has received 77 citations till now. The article focuses on the topics: Petri net & Stochastic Petri net.read more
Citations
More filters
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Coloured Petri nets
TL;DR: Colored Petri nets (CPN) as discussed by the authors is a formalism which extends ordinary Petri net by adding data types and modularity, which makes it possible to make succinct, readable and structured models.
Book ChapterDOI
Coloured Petri Nets: a high level language for system design and analysis
TL;DR: In this article, the authors describe how Coloured Petri Nets (CP-nets) have been developed from a promising theoretical model to being a full-fledged language for the design, specification, simulation, validation and implementation of large software systems.
Book
Coloured Petri Nets
TL;DR: It turns out that place-invariants and reachability trees, two of the most important methods for ordinary Petri nets, can be generalized to apply for Coloured Petrinets.
Journal ArticleDOI
The practitioner's guide to coloured Petri nets
TL;DR: This paper provides a comprehensive road map to the practical use of Petri nets and the Design/CPN tool and gives an informal introduction to the basic concepts and ideas underlying CP-nets.
References
More filters
Journal ArticleDOI
Parallel program schemata
TL;DR: This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel sequencing, related to Ianov's program schema, but extends it, both by modelling memory structure in more detail and by admitting parallel computation.
Journal ArticleDOI
System modelling with high-level Petri nets
TL;DR: A linear-algebraic techniques for verifying invariant assertions are used, yielding a calculus of S-invariants for PrT-nets, and these modelling and analysis techniques are applied to a scheme for organizing a distributed data base taken from literature.
Journal ArticleDOI
Coloured petri nets and the invariant-method
TL;DR: It is shown how Petri nets can be generalized to allow processes to be described by a common subnet, without losing the ability to distinguish between them.
Book ChapterDOI
High-Level Petri Nets
TL;DR: This paper combines two closely related net models, predicate/transition nets and coloured Petri nets, into a new net model called high-level Petrinets, intended to combine the qualities of the two old models into a single formalism.
Book
Decidability questions for Petri nets
TL;DR: A number of Petri Net problems are shown to be recursively equivalent to the Reachability Problem for Vector Addition Systems, and the equality of Reachability Sets and the equivalence of two Petri Nets in terms of their language-generating capability are recursive undecidable.