An efficient method for unfolding colored Petri nets

Authors:
Fei Liu;Monika Heiner;Ming Yang
Affiliations:
Harbin Institute of Technology, Harbin, China;Brandenburg University of Technology, Cottbus, Germany;Harbin Institute of Technology, Harbin, China
Venue:
Proceedings of the Winter Simulation Conference
Year:
2012

Citing 7
Cited 1

Elements of ML programming (ML97 ed.)

Elements of ML programming (ML97 ed.)
The Analysis of Distributed Systems by Means of Predicate ? Transition-Nets

Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Optimising Enabling Tests and Unfoldings of Algebraic System Nets

ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Implementing Coloured Petri Nets Using a Functional Programming Language

Higher-Order and Symbolic Computation
Snoopy - a unifying Petri net framework to investigate biomolecular networks

Bioinformatics
Petri nets for systems and synthetic biology

SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
Optimized colored nets unfolding

FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Colouring space - a coloured framework for spatial modelling in systems biology

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unfolding is an essential problem in reusing existing Petri net simulation and analysis techniques and related tools for colored Petri nets. We present an efficient unfolding method, in which we provide two approaches to efficiently compute transition instances. That is, for a transition, if the color set of each variable in its guard is a finite integer domain, a constraint satisfaction approach is used to obtain all valid transition instances; otherwise, a general algorithm is adopted, in which some optimization techniques like partial binding -- partial test and pattern matching are used. This method has been applied to unfold large-scale colored Petri nets, which has proven its efficiency.