Behaviour-preserving transition insertions in unfolding prefixes

Authors:
Victor Khomenko
Affiliations:
School of Computing Science, Newcastle University, Newcastle upon Tyne, UK
Venue:
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Year:
2007

Citing 7
Cited 4

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
A unified signal transition graph model for asynchronous control circuit synthesis

Formal Methods in System Design
An Improvement of McMillan's Unfolding Algorithm

Formal Methods in System Design
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
Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Logic synthesis for asynchronous circuits based on STG unfoldings and incremental SAT

Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
Detecting State Encoding Conflicts in STG Unfoldings Using SAT

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)

Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)
A new type of behaviour-preserving transition insertions in unfolding prefixes

ICGT'10 Proceedings of the 5th international conference on Graph transformations
Efficient automatic resolution of encoding conflicts using STG unfoldings

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Resolution of Encoding Conflicts by Signal Insertion and Concurrency Reduction Based on STG Unfoldings

Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'06)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some design methods based on Petri nets modify the original specification by behaviour-preserving insertion of new transitions. If the unfolding prefix is used to analyse the net, it has to be re-unfolded after each modification, which is detrimental for the overall performance. The approach presented in this paper applies the transformations directly to the unfolding prefix, thus avoiding re-unfolding. This also helps in visualisation, since the application of a transformation directly to the prefix changes it in a way that was 'intuitively expected' by the user, while re-unfolding can dramatically change the shape of the prefix. Moreover, rigourous validity checks for several kinds of transition insertions are developed. These checks are performed on the original unfolding prefix, so one never has to backtrack due to the choice of a transformation which does not preserve the behaviour.