𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Processes of timed Petri nets

✍ Scribed by Józef Winkowski


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
286 KB
Volume
243
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis


Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features re ect the execution times of processes and allow to combine processes sequentially and in parallel, which leads to some algebras. The processes can be represented either without specifying when particular situations appear (free processes), or together with the respective appearance times (timed processes). The processes of the latter type determine the possible ÿring sequences of the respective nets.


📜 SIMILAR VOLUMES


Qualitative simulation of temporal concu
✍ Vadim Bulitko; David C. Wilkins 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 820 KB

This paper presents a formalism called Time Interval Petri Nets (TIPNs), which are designed to support a qualitative simulation of temporal concurrent processes. One of the key features of TIPNs is a uniform use of time intervals throughout the model. This enables a natural and efficient representat

Timed petri nets
📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 152 KB
Real-Time Systems || Timed Petri Nets
✍ Cheng, Albert M. K. 📂 Article 📅 2002 🏛 John Wiley & Sons, Inc. ⚖ 171 KB 👁 2 views

## TIMED PETRI NETS Petri nets were developed as an operational formalism for specifying untimed concurrent systems. They can show concurrent activities by depicting control and data flows in different parts of the modeled system. As an operational formalism, a Petri net gives a dynamic representa

On possibilistic timed safe Petri nets
✍ Sandra Sandri; Janétte Cardoso 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 196 KB 👁 1 views

The first goal of this work is to extend a model of Timed Safe Petri Nets to allow the treatment of preference between transitions. In the proposed Possibilistic Timed Safe Petri Net, we attach a duration to each transition, which can be precise, imprecise, or fuzzy, accounting for the maximal amoun