Skip to main content
SpringerLink
Log in

A Logic for Non-deterministic Parallel Abstract State Machines

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9616))

Included in the following conference series:

Abstract

We develop a logic which enables reasoning about single steps of non-deterministic parallel Abstract State Machines (ASMs). Our logic builds upon the unifying logic introduced by Nanchen and Stärk for reasoning about hierarchical (parallel) ASMs. Our main contribution to this regard is the handling of non-determinism (both bounded and unbounded) within the logical formalism. Moreover, we do this without sacrificing the completeness of the logic for statements about single steps of non-deterministic parallel ASMs, such as invariants of rules, consistency conditions for rules, or step-by-step equivalence of rules.

Work supported by the Austrian Science Fund (FWF: [P26452-N15]). Project: Behavioural Theory and Logics for Distributed Adaptive Systems.

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 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

Institutional subscriptions

References

  1. Ågotnes, T., Walicki, M.: Complete axiomatisations of properties of finite sets. Logic J. IGPL 16(3), 293–313 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alur, R.: Principles of Cyber-Physical Systems. MIT Press, Cambridge (2015)

    Google Scholar 

  3. Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. ACM Trans. Comp. Logic 4(4), 578–651 (2003)

    Article  MathSciNet  Google Scholar 

  4. Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms: correction and extension. ACM Trans. Comp. Logic 9(3), 1–32 (2008)

    MathSciNet  Google Scholar 

  5. Börger, E., Stärk, R.F.: Abstract State Machines: a Method for High-Level System Design and Analysis. Springer, New York (2003)

    Book  MATH  Google Scholar 

  6. Ferrarotti, F., Schewe, K., Tec, L., Wang, Q.: A new thesis concerning synchronised parallel computing - simplified parallel ASM thesis. CoRR abs/1504.06203 (2015). http://arxiv.org/abs/1504.06203

  7. Floyd, R.W.: Nondeterministic algorithms. J. ACM 14(4), 636–644 (1967). http://doi.acm.org/10.1145/321420.321422

    Google Scholar 

  8. Grädel, E., Gurevich, Y.: Metafinite model theory. Inf. Comput. 140(1), 26–81 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Groenboom, R., Renardel de Lavalette, G.: A formalization of evolving algebras. In: Proceedings of Accolade95. Dutch Research School in Logic (1995)

    Google Scholar 

  10. Huggins, J.K., Wallace, C.: An abstract state machine primer. Technical report 02–04, Computer Science Department, Michigan Technological University (2002)

    Google Scholar 

  11. Hughes, G., Cresswell, M.: A New Introduction to Modal Logic. Burns & Oates, London (1996)

    Book  MATH  Google Scholar 

  12. Kruskal, J.B.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Amer. Math. Soc. 2, 48–50 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  13. Stärk, R., Nanchen, S.: A logic for abstract state machines. J. Univ. Comput. Sci. 7(11) (2001)

    Google Scholar 

  14. Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer, New York (1995)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Competence Center Hagenberg, 4232, Hagenberg, Austria

    Flavio Ferrarotti, Klaus-Dieter Schewe & Loredana Tec

  2. Research School of Computer Science, The Australian National University, Canberra, ACT, 0200, Australia

    Qing Wang

Authors
  1. Flavio Ferrarotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus-Dieter Schewe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Loredana Tec
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Flavio Ferrarotti .

Editor information

Editors and Affiliations

  1. Faculteit Wetenschappen, Universiteit Hasselt, Hasselt, Belgium

    Marc Gyssens

  2. Dept. Ciencias Ingeniería Computación, Universidad Nacional del Sur, Bahía Blanca, Argentina

    Guillermo Simari

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Ferrarotti, F., Schewe, KD., Tec, L., Wang, Q. (2016). A Logic for Non-deterministic Parallel Abstract State Machines. In: Gyssens, M., Simari, G. (eds) Foundations of Information and Knowledge Systems. FoIKS 2016. Lecture Notes in Computer Science(), vol 9616. Springer, Cham. https://doi.org/10.1007/978-3-319-30024-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30024-5_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30023-8

  • Online ISBN: 978-3-319-30024-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation