Dynamic Slicing of Petri Nets Based on Structural Dependency Graph and its Application in System Analysis
From MaRDI portal
Publication:2813985
DOI10.1002/asjc.1031zbMath1338.93242OpenAlexW1952385907MaRDI QIDQ2813985
Xianwen Fang, Zhijun Ding, Wangyang Yu
Publication date: 17 June 2016
Published in: Asian Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/asjc.1031
Applications of graph theory (05C90) Discrete event control/observation systems (93C65) System structure simplification (93B11)
Related Items
Cites Work
- Unnamed Item
- Erratum to ``Liveness of an extended S\(^{3}\)PR [Automatica 46 (2010) 1008-1018]
- Reduction of constraints for controller synthesis based on safe Petri nets
- Liveness of an extended S\(^{3}\)PR
- Slicing communicating automata specifications: Polynomial algorithms for model reduction
- Modeling and control of discrete-event dynamic systems with Petri nets and other tools.
- Program Slicing
- Coloured Petri Nets
- Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis
- Dynamic Slicing Techniques for Petri Nets
- Structure reduction of liveness‐enforcing Petri nets using mixed integer programming
- Slicing Petri Nets with an Application to Workflow Verification
- A simple Suboptimal siphon‐based control model of a well‐known S3PR
- A deadlock prevention approach for flexible manufacturing systems with uncontrollable transitions in their Petri net models
- A best deadlock control for S3PMR to reach all states
