Skip to main content

Study of Stepwise Simulation Between ASM

  • 287 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 11558)

Abstract

In this paper we study the notion of stepwise simulation between Abstract State Machines, to explore if some natural change on the original definition would keep it sound. We prove that we have to keep the classical notion and give results about the computability of the simulation itself.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-030-22996-2_14
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   59.99
Price excludes VAT (USA)
  • ISBN: 978-3-030-22996-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   79.99
Price excludes VAT (USA)

Notes

  1. 1.

    Given an ASM, the well definition of an ASM is undecidable. However, one could add some rules to detect incoherence at runtime and behave accordingly.

References

  1. Cégielski, P., Guessarian, I.: Normalization of some extended abstract state machines. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol. 6300, pp. 165–180. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15025-8_9

    CrossRef  MATH  Google Scholar 

  2. Gurevich, Y.: Reconsidering Turing’s Thesis: Toward More Realistic Semantics of Programs. University of Michigan, Technical report CRL-TR-38-84, EECS Department (1984)

    Google Scholar 

  3. Gurevich, Y.: A new thesis. Abstracts Am. Math. Soc. 6, 317 (1985)

    Google Scholar 

  4. Marquer, Y., Valarcher, P.: An imperative language characterizing PTIME algorithms. In: Cégielski, P., Enayat, A., Kossak, R. (eds.) Studies in Weak Arithmetics: Volume 3. Lecture Note 217. CSLI Publications, Stanford (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Julien Cervelle .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Cégielski, P., Cervelle, J. (2019). Study of Stepwise Simulation Between ASM. In: Manea, F., Martin, B., Paulusma, D., Primiero, G. (eds) Computing with Foresight and Industry. CiE 2019. Lecture Notes in Computer Science(), vol 11558. Springer, Cham. https://doi.org/10.1007/978-3-030-22996-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-22996-2_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-22995-5

  • Online ISBN: 978-3-030-22996-2

  • eBook Packages: Computer ScienceComputer Science (R0)