Networks of Timed Automata (NTA) and Time Petri Nets (TPNs) are well-established formalisms used to model, analyze and control industrial real-time systems. The underlying theories are usually developed in different scientific communities and both formalisms have distinct strong points: for instance, conciseness for TPNs and a more flexible notion of urgency for NTA. The objective of the paper is to introduce a new model allowing the joint use of both TPNs and NTA for the modeling of timed systems. We call it Clock Transition System (CTS). This new model incorporates the advantages of the structure of Petri nets, while introducing explicitly the concept of clocks. Transitions in the network can be guarded by an expression on the clocks and reset a subset of them as in timed automata. The urgency is introduced by a separate description of invariants. We show that CTS allow to express TPNs (even when unbounded) and NTA. For those two classical models, we identify subclasses of CTSs equivalent by isomorphism of their operational semantics and provide (syntactic) translations. The classical state-space computation developed for NTA and then adapted to TPNs can easily be defined for general CTSs. Armed with these merits, the CTS model seems a good candidate to serve as an intermediate theoretical and practical model to factor out the upcoming developments in the TPNs and the NTA scientific communities.
Models of complex biological systems can be built using different types of Petri nets. Qualitative nets, for example, can be successfully used to obtain a model of such a system and on its basis a structure-based analysis can be performed. Time is an important factor influencing a whole biological system behaviour and in many cases it should be considered during building a model of such a system. In this paper various types of time Petri nets have been described and methods for studying corresponding models have been discussed. In particular, an algorithm using time parameters to enhance t-invariants based analysis is proposed. This algorithm allows for calculation of the minimal and maximal numbers of tokens (respectively, for an optimistic and pessimistic case) in particular places necessary to assure that all transitions from a given t-invariant support will be able to fire. Additionally, to address the problem of the proper assignment of time values to transitions, the known methods for calculation and evaluation of such time parameters based on the net structure have also been discussed.
A Petri deterministic time net applied to the modelling of the material flow at the steel plant is a very effective research tool. This paper presents a Petri net expanded with the attribute vectors of places and transitions, as well as the logical rules of transition launching and the procedures that update the attribute values. Owing to such an expansion, we can observe the properties of the streams that flow through the system, e.g. the costs and the project completion time, simulate the effects of the changes introduced into the system and analyse the results of unexpected disturbances and the breaks in the supply chain.
PL
Deterministyczna czasowa sieć Petriego zastosowana do modelowania przepływu materiałów na wydziale stalowni jest bardzo efektywnym narzędziem badawczym. W artykule przedstawiono rozszerzenie sieci Petriego o wektory atrybutów miejsc i tranzycji, o logiczne reguły odpaleń tranzycji i procedury uaktualniające wartości tych atrybutów. Dzięki temu rozszerzeniu można obserwować właściwości przepływających przez system strumieni, m.in. koszt i czas realizacji całego przedsięwzięcia, symulować efekty wprowadzanych do systemu zmian, analizować efekty niespodziewanych zakłóceń i przerwań zachodzących w przepływie materiałów.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.