Dynamic slicing of Petri nets based on structural dependency graph and its application in system analysis
From MaRDI portal
Publication:2813985
Recommendations
Cites work
- scientific article; zbMATH DE number 1949623 (Why is no real title available?)
- A best deadlock control for S\(^{3}\)PMR to reach all states
- A deadlock prevention approach for flexible manufacturing systems with uncontrollable transitions in their Petri net models
- A simple suboptimal siphon-based control model of a well-known S\(^{3}\)PR
- Coloured Petri Nets
- Dynamic slicing techniques for Petri nets
- Erratum to ``Liveness of an extended S\(^{3}\)PR [Automatica 46 (2010) 1008-1018]
- Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis
- Liveness of an extended S\(^{3}\)PR
- Modeling and control of discrete-event dynamic systems with Petri nets and other tools.
- Program Slicing
- Reduction of constraints for controller synthesis based on safe Petri nets
- Slicing Petri Nets with an Application to Workflow Verification
- Slicing communicating automata specifications: Polynomial algorithms for model reduction
- Structure reduction of liveness-enforcing Petri nets using mixed integer programming
Cited in
(4)
This page was built for publication: Dynamic slicing of Petri nets based on structural dependency graph and its application in system analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2813985)
