Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
From UML sequence diagrams and statecharts to analysable petri net models
WOSP '02 Proceedings of the 3rd international workshop on Software and performance
A Survey: Applying Formal Methods to a Software Intensive System
HASE '01 The 6th IEEE International Symposium on High-Assurance Systems Engineering: Special Topic: Impact of Networking
Optimising Enabling Tests and Unfoldings of Algebraic System Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Data Decision Diagrams for Petri Net Analysis
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
Generative Families of Positive Invariants in Coloured Nets Sub-Classes
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
On the Formal Verification of Middleware Behavioral Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic symmetry detection in well-formed nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
The NEO protocol for large-scale distributed database systems: modelling and initial verification
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Computing a hierarchical static order for decision diagram-based representation from p/t nets
Transactions on Petri Nets and Other Models of Concurrency V
An efficient method for unfolding colored Petri nets
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
As some structural properties, like generative families of positive P-invariants, can only be computed in P/T nets, unfolding of Colored Petri Nets is of interest. However, it may generate huge nets that cannot be stored concretely in memory. In some cases, removing the dead parts of the unfolded net can dramatically reduce its size, but this operation requires the unfolded net to be represented anyway. This paper presents a symbolic representation of unfolded nets using Data Decision Diagrams. This technique allows to store very large models and manipulate them for optimization purpose.