Skip to main content
SpringerLink
Log in

Simulation Problems for One-Counter Machine

  • Conference paper
  • First Online:
SOFSEM’99: Theory and Practice of Informatics (SOFSEM 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1725))

Abstract

We consider decidability questions for simulation preorder (and equivalence) for processes generated by one-counter machines. We sketch a proof of decidability in the case when testing for zero is not possible, and demonstrate the undecidability in the general case.

The first and third authors are partially supported by the Grant Agency of the Czech Republic, Grant No. 201/97/0456. The second author is partially supported by TFR grant No. 221-98-103.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdulla, P., K. Čerāns (1998). Simulation is decidable for one-counter nets (Extended Abstract.) In Proceedings of CONCUR’98, Lecture Notes in Computer Science 1466:253–268.

    Google Scholar 

  2. Jančar, P. (1997). Decidability of bisimilarity for one-counter processes.In Proceedings of ICALP’97, Lecture Notes in Computer Science 1256:549–559. (Revised version to appear in The Journal of Information and Computation).

    Google Scholar 

  3. Jančar, P.,F. Moller (1999). Simulation on one-counter nets via colouring. Uppsala Univ. CSD Report No.159, February 1999. http://www.csd.uu.se/papers/reports.html

  4. Moller, F. (1996). In finite results. Proceedings of CONCUR’96, Lecture Notes in Computer Science 1119:195–216.

    Google Scholar 

  5. Minsky, M. (1967). Computation: Finite and In finite Machines. Prentice-Hall, Englewood Cliffs, NJ.

    MATH  Google Scholar 

  6. Valiant, L.G., M.S. Paterson (1975).Deterministic one-counter automata. Journal of Computer and System Science 10:340–350.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical University of Ostrava, Czech Republic

    Petr Jančar

  2. Uppsala University, Sweden

    Faron Moller

Authors
  1. Petr Jančar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Faron Moller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. 1Zdeněk Sawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. DCIT, s.r.o, J. Martího 2/407, 162 02, Prague 6, Czech Republic

    Jan Pavelka

  2. Department of Computer Science, University of Utrecht, Padualaan 14, 3584, CH, Utrecht, The Netherlands

    Gerard Tel

  3. Institute of Computer Science, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic

    Miroslav Bartošek

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jančar, P., Moller, F., Sawa, 1. (1999). Simulation Problems for One-Counter Machine. In: Pavelka, J., Tel, G., Bartošek, M. (eds) SOFSEM’99: Theory and Practice of Informatics. SOFSEM 1999. Lecture Notes in Computer Science, vol 1725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47849-3_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-47849-3_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66694-3

  • Online ISBN: 978-3-540-47849-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation