Skip to main content
SpringerLink
Log in
Book cover

Conference on Computability in Europe

CiE 2019: Computing with Foresight and Industry pp 156–167Cite as

Study of Stepwise Simulation Between ASM

  • Conference paper
  • First Online:

  • 353 Accesses

Part of the book series: Lecture Notes in Computer Science ((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, 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 EPUB and 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

Learn about institutional subscriptions

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

    Chapter  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

  1. LACL, Université Paris-Est Créteil, 94010, Créteil Cedex 2, France

    Patrick Cégielski & Julien Cervelle

Authors
  1. Patrick Cégielski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julien Cervelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Julien Cervelle .

Editor information

Editors and Affiliations

  1. Christian Albrechts University of Kiel, Kiel, Germany

    Florin Manea

  2. Durham University, Durham, UK

    Barnaby Martin

  3. Durham University, Durham, UK

    Daniël Paulusma

  4. Università degli Studi di Milano, Milan, Italy

    Giuseppe Primiero

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. 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)

Publish with us

Policies and ethics

Search

Navigation