Weak Time Petri Nets Strike Back!

@inproceedings{Reynier2009WeakTP,
  title={Weak Time Petri Nets Strike Back!},
  author={Pierre-Alain Reynier and Arnaud Sangnier},
  booktitle={CONCUR},
  year={2009}
}
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the stro ng one, for which all transitions are urgent, and the weak one, for which time can elapse arbitrarily. It is well known that many verification problems such a s the marking reachability are undecidable with the strong semantics. In this pape r, we focus on Time Petri Nets with weak semantics equipped with three different memory policies for the firing… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

Combining Free Choice and Time in Petri Nets

2016 23rd International Symposium on Temporal Representation and Reasoning (TIME) • 2016

Coverability Analysis of Time Basic Petri Nets with Non-Urgent Behavior

2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) • 2016
View 1 Excerpt

Back in time petri nets

FORMATS 2013 • 2013
View 1 Excerpt

Concurrency in Real-Time Distributed Systems

Jiří S RBA Rapporteur Walter V OGLER Rapporteur Béatric Examinateur
2011

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Decidability ofproperties of timed - arc Petri nets

V. Valero Ruiz D. de Frutos-Escrig
ICATPN ’ 00 , volume 1825 of LNCS • 2008

On the compared expressiveness of arc , pl ce and transition time Petri nets

O. H. Roux
Fundamenta Informaticae • 2008

Equivalenc e of timed state machines and safe time Petri nets

S. Haar, F. Simonot-Lion, L. Kaiser, J. Toussaint
In WoDES’02, • 2002

Similar Papers

Loading similar papers…