Reset Nets Between Decidability and Undecidability

@inproceedings{Dufourd1998ResetNB,
  title={Reset Nets Between Decidability and Undecidability},
  author={Catherine Dufourd and Alain Finkel and Philippe Schnoebelen},
  booktitle={ICALP},
  year={1998}
}
We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net model. While Reachability is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decid-ability of Termination, Coverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separations between seemingly related problems. Our main theorem is the very surprising fact that boundedness… CONTINUE READING
Highly Influential
This paper has highly influenced 20 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

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

References

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

General decidability theorems for innnite-state systems

  • A Cjy, P A Abdulla, K Cerr Ans, B Jonsson, T Yih-Kuen
  • Proc. 11th IEEE Symp. Logic in Computer Science…
  • 1996

Reduction and covering of innnite reachability trees

  • A Fin, Finkel
  • Information and Computation
  • 1990

Petri Net Theory and the Modeling of Systems

  • J L Pet, Peterson
  • Petri Net Theory and the Modeling of Systems
  • 1981

On the computational power of extended Petri nets

  • R Val78a, Valk
  • Proc. 7th Symp. Math. Found. Comp. Sci. (MFCS'78)
  • 1978

Similar Papers

Loading similar papers…