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

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

1997
Monika Heiner

The development of provably error-free and efficient concurrent manufacturing systems is still a challenge of practical system engineering. Modelling and analysis of concurrent systems by means of Petri nets is one of the well-known approaches using formal methods. Among those Petri net analysis techniques suitable for strong verification purposes there is an increasing amount of promising meth...

2013
Ciarán P. Fisher Nicholas J. Plant J. Bernadette Moore Andrzej M. Kierzek

MOTIVATION Dynamic simulation of genome-scale molecular interaction networks will enable the mechanistic prediction of genotype-phenotype relationships. Despite advances in quantitative biology, full parameterization of whole-cell models is not yet possible. Simulation methods capable of using available qualitative data are required to develop dynamic whole-cell models through an iterative proc...

Journal: :Processes 2023

An interval type-2 fuzzy set and Petri net combined risk assessment model for chemical production was proposed to solve the problems of disorganized hierarchy poorly targeted measures, as well requirement complex equipment associated with assessment. First, four different types databases were established according process cyclohexane. Considering intrinsic relationship between factors in fault ...

2008
H. Motameni A. Movaghar B. Shirazi M. Aminzadeh H. Samadi

Petri net is used widely to analyze and model various systems formally. Recently, Many Petri nets mania devote their efforts to enhancing and extending the expressive Power of Petri nets. One such effort is to extend Petri nets with object-oriented concepts. An object-oriented paradigm provides excellent concepts to model real-world problems. Object-oriented concepts allow us to build software ...

1997
Tuomas Aura Johan Lilius

Time Petri nets are Petri nets extended with a notion of time, where the occurrence time of a transition is constrained by a static interval. The objective of this work is to give time Petri nets a partial order semantics, based on the nonsequential processes semantics for untimed net systems. A time process of a time Petri net is deened as a traditionally constructed causal process that has a ...

2003
Mariken H.C. Everdij Henk A.P. Blom

This paper extends the power hierarchy of dependability models developed by Malhotra and Trivedi (1994) and Muppala et al. (2000) to include Piecewise Deterministic Markov Processes (PDP) and PDP-related Petri Nets. PDPs are known as the largest class of continuous-time hybrid state Markov processes not involving diffusions. Since Petri Nets have proven to be extremely useful in developing Mark...

2013
Goharik R. Petrosyan Andrey M. Avetisyan Lilit A. Ter-Vardanyan

The article studies the interrelation of Languages of Colored Petri Nets and Traditional formal languages. The author constructed the graph of Colored Petri Net, which generates L Context-free language. This language may not be modeled using standard Petri Nets [1]. The Venn graph and diagram that the author modified [1], show the interrelation between languages of Colored Petri Nets and some T...

2008
Jonathan Hayman Glynn Winskel

The unfolding of (1-)safe Petri nets to occurrence nets is well understood. There is a universal characterization of the unfolding of a safe net which is part and parcel of a coreflection from the category of occurrence nets to the category of safe nets. The unfolding of general Petri nets, nets with multiplicities on arcs whose markings are multisets of places, does not possess a directly anal...

2016
S. Akshay Blaise Genest Loïc Hélouët

Adding real time information to Petri net models often leads to undecidability of classical verification problems such as reachability and boundedness. For instance, models such as Timed-Transition Petri nets (TPNs) [22] are intractable except in a bounded setting. On the other hand, the model of TimedArc Petri nets [26] enjoys decidability results for boundedness and control-state reachability...

1999
Marc Boyer Michel Diaz

It had been shown that Merlin’s Time Petri Nets are a special case of Time Stream Petri Nets. In this paper, we show that it does not exist a time equivalence between both models. We extend first this result to the non equivalence of Timed Automata and Time Petri Nets and second to the non equivalence of Timed Link Petri Net and Timed Transition Petri Net.

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

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