نتایج جستجو برای: colored petri nets

تعداد نتایج: 42109  

2017
Rowland Pitts Hassan Gomaa George Mason

Concurrent software systems are growing increasingly large and complex; the risks associated with poor design and architectural choices are increasing as well. Building executable prototypes can help identify problems early and Colored Petri Nets are well suited to this purpose. This paper presents an approach to modeling reusable threadsafe passive entity objects in Colored Petri Nets, includi...

2012
Anthony Spiteri Staines

This paper describes how colored Petri nets can be used for modeling the Paris underground Metro system. This is one of the most complex metro systems in the world. In this paper, the metro system is analyzed and described. The method of analysis is outlined. A working model for three of the major lines was constructed using CPNs. The results and other issues that have to be tackled are explain...

2009
Yingmin LI Tarek MELLITI Philippe DAGUE

The paper contributes to modeling an orchestrated complex Web Service (BPEL) with Colored Petri Nets (CPNs) for diagnosis. In the CPNs model, colored tokens are used to represent the faults in a BPEL process. A uniform fault model is introduced to represent both the faulty input data and external faulty Web services called by the BPEL activities. We use three I/O data dependency relations for e...

2009
Yingmin LI Tarek MELLITI Philippe DAGUE

The paper contributes to modeling an orchestrated complex Web Service (BPEL) with Colored Petri Nets (CPNs) for diagnosis. In the CPNs model, colored tokens are used to represent the faults in a BPEL process. A uniform fault model is introduced to represent both the faulty input data and external faulty Web services called by the BPEL activities. We use three I/O data dependency relations for e...

1998
Peter Kemper

Reachability analysis is a general approach to analyze Petri nets, but the state space explosion often permits its application. In the eld of performance analysis of stochastic Petri nets, modular representations of reachability graphs using Kronecker algebra have been successfully applied. This paper describes how a Kronecker representation of the reachability graph is employed for exploration...

Journal: :International Journal on Software Tools for Technology Transfer 2007

2009
Sidney Rosario Jean-Pierre BANATRE Jean-Bernard STEFANI Bruno GAUJAL William COOK Albert BENVENISTE Claude JARD Jean-Pierre Banâtre

Web Services orchestrations require a firm mathematical basis for their development. We start from the Orc formalism proposed by J. Misra and co-workers, at Austin University. Orc is small and elegant and captures the essence of orchestrations. We translate Orc into colored Petri net systems, a generalization of Petri nets allowing to handle recursion—this formalism was recently proposed by Dev...

2013
Fei Liu Ming Yang

The stochastic modeling of biological systems is gaining more and more attention when stochastic fluctuations need to be described. On the other hand, the biological systems under investigation become much more complex than before. Traditional modeling methods like stochastic Petri nets do not easily scale and thus become difficult to tackle this situation. This paper aims to present a colored ...

Journal: :Journal of Korean Institute of Intelligent Systems 2006

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید