High-level Petri-net model for a resource-sharing problem
Information Sciences: an International Journal
Stubborn sets for model checking the EF/AG fragment of CTL
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Place or Transition Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Optimal simulations, nets and reachability graphs
Papers from the 11th International Conference on Applications and Theory of Petri Net: Advances in Petri Nets 1991
Dynamic partial-order reduction for model checking software
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Colored Petri Nets State-Space Reduction via Symbolic Execution
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Question-guided stubborn set methods for state properties
Formal Methods in System Design
Compositional State Space Reduction Using Untangled Actions
Electronic Notes in Theoretical Computer Science (ENTCS)
Soundness-preserving reduction rules for reset workflow nets
Information Sciences: an International Journal
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
Information Sciences: an International Journal
Petri net modeling and deadlock analysis of parallel manufacturing processes with shared-resources
Journal of Systems and Software
CEEMAS'03 Proceedings of the 3rd Central and Eastern European conference on Multi-agent systems
Canonical transition set semantics for petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
On Siphon Computation for Deadlock Control in a Class of Petri Nets
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Fluctuation-driven computing on number-conserving cellular automata
Information Sciences: an International Journal
Module-based architecture for a periodic job-shop scheduling problem
Computers & Mathematics with Applications
Secure interoperation design in multi-domains environments based on colored Petri nets
Information Sciences: an International Journal
Robustness of deadlock control for a class of Petri nets with unreliable resources
Information Sciences: an International Journal
Hi-index | 0.07 |
A method of analysis for a class of Petri nets (PNs) called parallel process net with resources (PPNRs) is presented in this paper. The proposed analysis method is based on reduced reachability graph (RRG) of PPNRs to verify the correspondence between required specification of manufacturing system and its PN representation. In order to reduce the reachability graph (RG), a new technique is proposed which incorporates the transition vectors (TVs) to determine all the enabled transitions at a given state of system and to recognize them as dependent or independent. An algorithm, based on the idea of simultaneous execution of concurrently enabled independent transitions, is developed to reduce the RG and its analysis is also performed. Moreover, relationship between the reduction of RG and parallel structure in the PN model is discovered. The proposed technique replaces the RG by a structure which directly depicts concurrent execution and does not show the irrelevant states by presenting the concurrent behavior of system in the reduced state space. The analysis of PPNRs based on RRG generated by proposed method is also presented and demonstrated by a practical example.