High-level Petri nets: theory and application
High-level Petri nets: theory and application
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Efficient Discrete-Event Simulation of Colored Petri Nets
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
A symbolic reachability graph for coloured Petri nets
Theoretical Computer Science
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
An Efficient Algorithm for the Computation of Stubborn Sets of Well Formed Petri Nets
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Finding Stubborn Sets of Coloured Petri Nets Without Unfolding
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
An Efficient Algorithm for Finding Structural Deadlocks in Colored Petri Nets
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Well-Defined Generalized Stochastic Petri Nets: A Net-Level Method to Specify Priorities
IEEE Transactions on Software Engineering
A Petri-Net Based Reflective Framework for the Evolution of Dynamic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On the computation of stubborn sets of colored petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Expressiveness and efficient analysis of stochastic well-formed nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
Well-formed Nets (WN) structural analysis techniques allow to study interesting system properties without requiring the state space generation. In order to avoid the net unfolding, which would reduce significantly the effectiveness of the analysis, a symbolic calculus allowing to directly work on the WN colour structure is needed. The algorithms for high level Petri nets structural analysis most often require a common subset of operators on symbols annotating the net elements, in particular the arc functions. These operators are the function difference, the function transpose and the function composition. This paper focuses on the first two, it introduces a language to denote structural relations in WN and proves that it is actually closed under the difference and transpose.