A new type of behaviour-preserving transition insertions in unfolding prefixes

Authors:
Victor Khomenko
Affiliations:
School of Computing Science, Newcastle University, UK
Venue:
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Year:
2010

Citing 5
Cited 0

Branching processes of Petri nets

Acta Informatica
An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
Signal Graphs: From Self-Timed to Timed Ones

International Workshop on Timed Petri Nets
Behaviour-preserving transition insertions in unfolding prefixes

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Efficient automatic resolution of encoding conflicts using STG unfoldings

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new kind of behaviour-preserving insertions of new transitions in Petri nets is proposed, and a method for computing such insertions using a complete unfolding prefix of the Petri net is developed. Moreover, as several transformations often have to be applied one after the other, the developed theory allows one to avoid (expensive) reunfolding after each transformation, and instead use local modifications on the existing complete prefix to obtain a complete prefix of the modified net.