Dynamic Slicing Techniques for Petri Nets | Zendy

Marisa Llorens | Zendy; Javier Oliver | Zendy; Josep Silva | Zendy; Salvador Tamarit | Zendy; Germán Vidal | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Dynamic Slicing Techniques for Petri Nets

Author(s) -

Marisa Llorens,

Javier Oliver,

Josep Silva,

Salvador Tamarit,

Germán Vidal

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.12.037

Subject(s) - petri net , reachability , computer science , slicing , debugging , program slicing , process architecture , programming language , stochastic petri net , graph , context (archaeology) , theoretical computer science , distributed computing , paleontology , world wide web , biology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research