Filters








718 Hits in 6.9 sec

Modeling of Resource Allocation Mechanisms in Distributed Computing Systems using Petri Nets and Stochastic Activity Networks (SAN): a Review and Reo-based Suggestion [article]

Mohammad Reza Besharati, Ali Sepehri Khameneh
2021 arXiv   pre-print
Various models of Petri Net (Stochastic PN, Colored PN, Generalized PN, etc.) are used for modeling, simulation, execution, and solving the problems of resource allocation.  ...  It is a key step in designing the mechanisms of systems for determining the resource allocation mechanism, it is important for obtaining the desired efficiency in the system, plus it is vital for predicting  ...  Since Petri Nets possess proper formalism and defined algorithms for the prediction of the deadlocks on their structure, they are important as well.  ... 
arXiv:2103.07237v1 fatcat:paoukofu3rhtpkp3a5ezqjwcyi

Report on the Model Checking Contest at Petri Nets 2011 [chapter]

Fabrice Kordon, Alban Linard, Didier Buchs, Maximilien Colange, Sami Evangelista, Kai Lampka, Niels Lohmann, Emmanuel Paviot-Adet, Yann Thierry-Mieg, Harro Wimmel
2012 Lecture Notes in Computer Science  
It discusses the enhancements required for future editions of the Model Checking Contest event at the Petri Nets conference.  ...  Petri nets).  ...  Acknowledgements The Model Checking Contest @ Petri nets organizers would like to thank the following people for the help they provided in setting up this event: Clément Démoulins (infrastructure), Nicolas  ... 
doi:10.1007/978-3-642-35179-2_8 fatcat:joniyupqprglhotup2mloxyv24

Elementary Siphons of Petri Nets and Deadlock Control in FMS

Mowafak Hassan Abdul-Hussin
2015 Journal of Computer and Communications  
of Petri nets to prevent deadlocks in FMS.  ...  Analyzer of Petri net models and their P-invariant analysis, and deadlock control are presented as tools for modelling, efficiency structure analysis, control, and investigation of the FMSs when different  ...  For the Petri net of Figure 7 is an S 3 PR.  ... 
doi:10.4236/jcc.2015.37001 fatcat:ussg27e5rrdgrp4m3ztrbxg6jy

Single Controller-Based Colored Petri Nets for Deadlock Control in Automated Manufacturing Systems

Kaid, Al-Ahmari, Li, Davidrajuh
2019 Processes  
In the second step, all control places obtained in the first step are merged into a single control place based on the colored Petri net to mark all SMSs.  ...  In the first step, we use a method of deadlock prevention based on strict minimal siphons (SMSs) to create a controlled Petri net model.  ...  Acknowledgments: The authors would like to thank King Saud University for funding and supporting this research through Researchers Supporting Project Number (RSP-2019/62).  ... 
doi:10.3390/pr8010021 fatcat:7ioh6zpfmnabvgrmzgyhfj5bz4

Automated Modeling of Dynamic Reliability Block Diagrams Using Colored Petri Nets

Ryan Robidoux, Haiping Xu, Liudong Xing, MengChu Zhou
2010 IEEE transactions on systems, man and cybernetics. Part A. Systems and humans  
Then we present an algorithm that automatically converts a DRBD model into a colored Petri net (CPN).  ...  Index Terms-System reliability, reliability block diagram (RBD), extensible markup language (XML), colored Petri net (CPN), time Petri net, formal modeling and analysis, automated verification, deadlock  ...  Wu and Zhou propose a novel control policy for deadlock avoidance for automated guided vehicle system using colored resource-oriented Petri nets, and the complexity of deadlock avoidance for the whole  ... 
doi:10.1109/tsmca.2009.2034837 fatcat:vtbzqse6ofbd3jvkqcyix64qt4

Quasar: A New Tool for Concurrent Ada Programs Analysis [chapter]

Sami Evangelista, Claude Kaiser, Jean-François Pradat-Peyre, Pierre Rousseau
2003 Lecture Notes in Computer Science  
predefined patterns that are combined by substitution and merging constructors; analysis of the model both by structural techniques and model-checking techniques; reporting deadlock or starvation results  ...  The analysis of a concurrent Ada program by our tool proceeds in four steps: automatic extraction of the concurrent part of the program; translation of the simplified program into a formal model using  ...  We claim that using colored Petri nets allows us to limit the combinatory explosion by combinig more easily and more efficiently structural techniques (that work directly on the model) and efficient techniques  ... 
doi:10.1007/3-540-44947-7_12 fatcat:lxxub6g42bdkngntqzmxb5a2qa

Deadlock Control and Fault Detection and Treatment in Reconfigurable Manufacturing Systems Using Colored Resource-Oriented Petri Nets Based on Neural Network

Husam Kaid, Abdulrahman Al-Ahmari, Zhiwu Li, Wadea Ameen
2021 IEEE Access  
In the first step, a colored resource-oriented timed Petri net (CROTPN) is designed for rapid and effective reconfiguration of the RMS without considering resource failures.  ...  It is shown that the proposed approach can handle any complex RMS configurations, solve the deadlock problem in an RMS, and detect and treat failures. Furthermore, is simpler in its structure.  ...  ACKNOWLEDGMENT The authors are grateful to the Raytheon Chair for Systems Engineering for funding.  ... 
doi:10.1109/access.2021.3084995 fatcat:aq57fauo2navtdga4nrorrncii

Colored Resource-Oriented Petri Nets for Deadlock Control and Reliability design of Automated Manufacturing Systems

Adel Al-Shayea, Husam Kaid, Abdulrahman Al-Ahmari, Emad Abouel Nasr, Ali K. Kamrani, Haitham A. Mahmoud
2021 IEEE Access  
Davidrajuh, "Intelligent colored token Petri nets for modeling, control, and validation of dynamic changes Failures, deadlock avoidance, reliability, neural network, colored Petri net, automated manufacturing  ...  Davidrajuh, "Single controller-based colored Petri nets for deadlock control in automated manufacturing systems," Processes, vol. 8, no. 1, p. 21, 2020. Ref. [38] Ref.  ...  Author Name: Preparation of Papers for IEEE Access (February 2017) Using the unreliable net (NU, MUo) presented in Figure 9 , the data we need are calculated.  ... 
doi:10.1109/access.2021.3111575 fatcat:c4sijcygd5cejampey45mkhicy

High Level Petri Nets Analysis with Helena [chapter]

Sami Evangelista
2005 Lecture Notes in Computer Science  
This paper presents the high level Petri nets analyzer Helena.  ...  Helena can be used for the on-the-fly verification of state properties, i.e., properties that must hold in all the reachable states of the system, and deadlock freeness.  ...  However, defining an algorithm which computes good stubborn sets for colored Petri nets is a difficult task.  ... 
doi:10.1007/11494744_26 fatcat:m4ma4hqkezfxtdamgib4spqxja

A Petri Net Approach Based Elementary Siphons Supervisor for Flexible Manufacturing Systems

Mowafak Hassan Abdul-Hussin
2015 International Journal of Scientific and Engineering Research  
Petri net models in the efficiency structure analysis, and utilization of the FMSs when different policy can be implemented lead to the deadlock prevention.  ...  Simulation of Petri net structural analysis and reachability graph analysis is used for analysis and control of Petri nets.  ...  In addition, Petri net models in the efficiency structure analysis and utilization of the FMSs when different policy can be implemented for the prevention of deadlock. Ezpeleta et al.  ... 
doi:10.14299/ijser.2015.05.009 fatcat:5jpxhhyoavauzc5wndbkvcpe3m

Presentation of the 9th Edition of the Model Checking Contest [chapter]

Elvio Amparore, Bernard Berthomieu, Gianfranco Ciardo, Silvano Dal Zilio, Francesco Gallà, Lom Messan Hillah, Francis Hulin-Hubard, Peter Gjøl Jensen, Loïg Jezequel, Fabrice Kordon, Didier Le Botlan, Torsten Liebke (+7 others)
2019 Msphere  
The Model Checking Contest (MCC) is an annual competition of software tools for model checking.  ...  Tools must process an increasing benchmark gathered from the whole community and may participate in various examinations: state space generation, computation of global properties, computation of some upper  ...  We provide an automatic system for finding and applying structural reductions on nets.  ... 
doi:10.1007/978-3-030-17502-3_4 fatcat:i63wf7m4fzggxpl54xxwpv3jei

Applying Infinite Petri Nets to the Cybersecurity of Intelligent Networks, Grids and Clouds

Dmitry A. Zaitsev, Tatiana R. Shmeleva, David E. Probert
2021 Applied Sciences  
For analysis of computing and communication grid structures, a new class of infinite Petri nets has been introduced and studied for more than 10 years.  ...  In the present paper, infinite Petri nets are divided into two following kinds: a single infinite construct and an infinite set of constructs of specified size (and number of dimensions).  ...  Both Finite and Infinite Petri Nets will provide excellent systems support in the efficient design of emerging cybersecurity standards particularly those involving machine and deep learning algorithms  ... 
doi:10.3390/app112411870 fatcat:nyyosu2tovfybmjm2imhb3rx3q

A Survey on Workflow Verifications of Petri Nets based Service Process Management

Xiaoxian Yang, Tao Yu, Huahu Xu
2012 International Journal of Grid and Distributed Computing  
Then, considering the composite service is an effective way to organize third-party business functions seamlessly, the Petri Nets based service workflow employed to formalizing composition behaviors is  ...  In this paper, it reviews workflow verifications of Petri Nets based service process management. First, the workflow and description supporting tools are introduced.  ...  In literature [14] , colored Petri Nets for services composition model is proposed, in which four kinds operations are introduced, for example, sequence, selection, loop, etc.  ... 
doi:10.14257/ijgdc.2015.8.6.09 fatcat:4oqtgzjla5azxhnerdv6oz7tq4

Advanced Saturation-based Model Checking of Well-formed Coloured Petri Nets

András Vörös, Dániel Darvas, Attila Jámbor, Tamás Bartha
2014 Periodica Polytechnica Electrical Engineering and Computer Science  
The saturation algorithm has an efficient iteration strategy. Combined with symbolic data structures, it can be used for state space generation and model checking of asynchronous systems.  ...  Section 3 introduces the saturation algorithm, and its application to coloured Petri nets in particular. Our contribution is a new saturation algorithm presented in Section 4.  ...  In [4] the authors introduced an efficient symbolic state space generation and model checking method for asynchronous systems, especially for Petri nets.  ... 
doi:10.3311/ppee.2080 fatcat:qwfrj5zz45gpbo2esqkn5ribjy

Analyzing Interacting BPEL Processes [chapter]

Niels Lohmann, Peter Massuthe, Christian Stahl, Daniela Weinberg
2006 Lecture Notes in Computer Science  
We present a technology chain that starts out with a BPEL process and transforms it into a Petri net model.  ...  In [4] we developed an algorithm to efficiently decide the controllability of an oWFN N .  ...  An open workflow net is a Petri net N = (P, T, F ), together with (1) an interface I = in ∪ out such that I ⊆ P , in ∩ out = ∅, and for all transitions t ∈ T it holds: if p ∈ in (p ∈ out), then (t, p)  ... 
doi:10.1007/11841760_3 fatcat:reer4tek5ffjvkyrdiy5ah53wq
« Previous Showing results 1 — 15 out of 718 results