Unfoldings of Coloured Petri Nets

Authors:
Vitaly E. Kozura
Affiliations:
-
Venue:
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Year:
2001

Citing 9
Cited 3

A New Unfolding Approach to LTL Model Checking

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Improvement of McMillan's Unfolding Algorithm

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Model Checking Using Net Unfoldings

TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Model Checking of Time Petri Nets Based on Partial Order Semantics

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
The State Explosion Problem

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A Structural Approach for the Analysis of Petri Nets by Reduced Unfoldings

Proceedings of the 17th International Conference on Application and Theory of Petri Nets
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Deadlock Checking Using Net Unfoldings

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Designing a LTL model-checker based on unfolding graphs

ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets

Mapping PUNITY to UniNet

Journal of Computer Science and Technology
Complete Process Semantics of Petri Nets

Fundamenta Informaticae
Complete Process Semantics of Petri Nets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the unfolding technique is applied to coloured Petri nets (CPN) [6,7]. The technique is formally described, the definition of a branching process of CPN is given. The existence of the maximal branching process and the important properties of CPN's unfoldings are proven. A new approach consisting in combining unfolding technique with symmetry and equivalence specifications [7] is presented and the important properties of obtained unfoldings are proven. We require CPN to be finite, n-safe and containing only finite sets of colours.