Dynamic Slicing Techniques for Petri Nets

Authors:
M. Llorens;J. Oliver;J. Silva;S. Tamarit;G. Vidal
Affiliations:
DSIC, Technical University of Valencia, Valencia, Spain;DSIC, Technical University of Valencia, Valencia, Spain;DSIC, Technical University of Valencia, Valencia, Spain;DSIC, Technical University of Valencia, Valencia, Spain;DSIC, Technical University of Valencia, Valencia, Spain
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 9
Cited 1

Free choice Petri nets

Free choice Petri nets
Beyond traditional program slicing

ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Reduction and slicing of hierarchical state machines

ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3

Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
Sequential and distributed model checking of Petri nets

International Journal on Software Tools for Technology Transfer (STTT) - Special section on parallel and distributed model checking
Slicing Petri nets with an application to workflow verification

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Slicing object-z specifications for verification

ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Program Slicing

IEEE Transactions on Software Engineering

Safety slicing petri nets

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

Petri nets provide a means for modelling and verifying the behavior of concurrent systems. Program slicing is a well-known technique in imperative programming for extracting those statements of a program that may affect a given program point. In the context of Petri nets, computing a net slice can be seen as a graph reachability problem. In this paper, we propose two slicing techniques for Petri nets that can be useful to reduce the size of the considered net, thereby simplifying subsequent analysis and debugging tasks by standard Petri net techniques.