Simulation of One-Counter Nets via Colouring

@inproceedings{Jancar1999SimulationOO,
  title={Simulation of One-Counter Nets via Colouring},
  author={Petr Jancar},
  year={1999}
}
Recently, Abdulla anďCerāns (1998) outlined an extensive and involved proof of the decidability of simulation preorder for one-counter ne ts. In this note, we present a short, complete proof based on simple colourings of the pla ne.1 1This paper was written during a visit by the first author to Upp sala University supported by a grant from the STINT Fellowship Programme. He is also partially supported by the Grant Agency of the Czech Republic, Grant No. 201/97/0456. 
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
12 Citations
5 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

More infinite results. Pr oceedings of Infinity’97

  • O. Burkart, J. Esparza
  • Electronic Notes in Theoretical Computer Science
  • 1997

Infinite results

  • F. Moller
  • Proceedings of CONC UR’96, Lecture Notes in…
  • 1996

Similar Papers

Loading similar papers…