Petri Nets with Time Windows: A Comparison to Classical Petri Nets

Authors:
Jan-Thierry Wegener;Louchka Popova-Zeugmann
Affiliations:
Department of Mathematics, Humbold University, Berlin, Germany. wegener@math.hu-berlin.de;(Correspd.) Department of Computer Science, Humboldt University, Berlin, Germany. popova@informatik.hu-berlin.de
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2009

Citing 7
Cited 0

Petri nets with time restrictions

Systems Analysis Modelling Simulation
Performance Evaluation of Systems Using Nets

Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control

Proceedings of the 14th International Conference on Application and Theory of Petri Nets
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
A study of the recoverability of computing systems.

A study of the recoverability of computing systems.
Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Analyzing Paths in Time Petri Nets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present Petri nets with time windows (tw-PN) where each place is associated with an interval (window). Every token which arrives at a place gets a real-valued clock which shows its "age". A transition can fire when all needed tokens are "old enough". When a token reaches an "age" equal to the upper bound of the place where it is situated, the "token's age", i.e., clock will be reset to zero. Following this we compare these time dependent Petri nets with their (timeless) skeletons. The sets of both their reachable markings are equal, their liveness behaviour is different, and neither is equivalent to Turing machines. We also prove the existence of runs where time gaps are possible in the tw-PN, which is an extraordinary feature.