نتایج جستجو برای: interval constraint petri nets
تعداد نتایج: 299403 فیلتر نتایج به سال:
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
Discrete event system, Supervisory control, Petri Net, Constraint This paper presents a method to manage the time in a manufacturing system for obtaining an optimized model. The system in this paper is modeled by the timed Petri net and the optimization is performed based on the structural properties of Petri nets. In a system there are some states which are called forbidden states an...
in this thesis, a structured hierarchical methodology based on petri nets is used to introduce a task model for a soccer goalkeeper robot. in real or robot soccer, goalkeeper is an important element which has a key role and challenging features in the game. goalkeeper aims at defending goal from scoring goals by opponent team, actually to prevent the goal from the opponent player’s attacks. thi...
Constraint Handling Rules (CHR) is a declarative rulebased concurrent committed-choice programming language. Petri nets are a well-known formalism for modeling and analysis of concurrent processes. We aim to develop a framework to exploit Petri nets as a tool for the modeling and analysis of CHR programs. In this paper, we show that place/transition nets can easily be embedded into CHR and we d...
In its basic version, Petri Nets are defined as fixed graphs, where the behaviour of the system is modelled as the marking of the graph which changes over time. This constraint makes the Petri Nets a poor tool to deal with reconfigurable systems as mobile computing systems, where the structure of the system can change as its behaviour, during time. Many extended Petri nets were proposed to deal...
The purpose of the paper is to compare timed and time Petri nets with constraint satisfaction problems and activity-on-arc graphs in the context of manufacturing. It is shown that constraints are not defined in the same way but that timed and time Petri nets could be translated into a set of activity-on-arc graphs. This translation is only straightforward for p-timed and p-time Petri nets.
this paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and petri nets. in the beginning, programmable logic controllers were widely designed by ladder logic diagrams. when complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. thus, petri nets as a high l...
We consider Time Petri Nets (TPN) for which a firing time interval is associated with each transition. State space abstractions for TPN preserving various classes of properties (LTL, CTL, CTL) can be computed, in terms of so called state classes. Some methods were proposed to check quantitative timed properties but are not suitable for effective verification of properties of real-life systems. ...
Timed Petri Nets (also called Duration Petri Nets, DPNs) [7, 8] are a commonly used class for modeling formally complex technical systems as embedded real time systems, for instance in aeronautics. Engineers stated that intervals allowing some variable duration of events would be a more realistic view, so Interval-Timed Petri Nets (ITPNs) have been proposed as generalizations in [2]. Hierarchic...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید